The Discovery of the Computer
The Diagonal Lemma Fails in Aristotelian Logic
The Development of Mathematical Logic from Russell to Tarski
The Development of Categorical Logic
The definable criterion for definability in Presburger arithmetic and
The Deduction Rule and Linear and Near
The Dedekind Reals in Abstract Stone Duality
The Dedekind Reals in Abstract Stone Duality
The Decision Problem for Standard Classes
The Cut-Elimination Theorem for Differential Nets with Promotion
The Computer Modelling of Mathematical Reasoning Alan Bundy
The computational content of Zorn`s lemma
The complexity of the dependence operator
The Complexity of Satisfiability Problems: Refining Schaefer`s
The Complexity of Local Stratification - SUrface
The Complete Proof Theory of Hybrid Systems
The Complete Proof Theory of Hybrid Systems
The Compactness Theorem for first-order logic
The Compactness Theorem 1 The Compactness Theorem
The Communication Process
