The Bulletin of Symbolic LogicAssociation for Symbolic Logic, 1997 - Electronic journals |
From inside the book
Results 1-3 of 78
Page 294
... ( Theorem 3 ) did have a version of Theorem 2.1 ; substantially the same version appeared in the expository work of Nicolas Bourbaki [ 1956 , p . 43 ] ( Chapter 3 , §2 , Lemma 3 ) .27 Zermelo's main contribution with his Well - Ordering ...
... ( Theorem 3 ) did have a version of Theorem 2.1 ; substantially the same version appeared in the expository work of Nicolas Bourbaki [ 1956 , p . 43 ] ( Chapter 3 , §2 , Lemma 3 ) .27 Zermelo's main contribution with his Well - Ordering ...
Page 297
... Theorem , the theorem for justifying definitions by recursion on the natural numbers , 35 In his axiomatization paper [ 1908a ] Zermelo provided a new proof of the Schröder - Bernstein Theorem , and it is noteworthy that themes of Kura ...
... Theorem , the theorem for justifying definitions by recursion on the natural numbers , 35 In his axiomatization paper [ 1908a ] Zermelo provided a new proof of the Schröder - Bernstein Theorem , and it is noteworthy that themes of Kura ...
Page 340
... Theorem we now have that E3 is minimal above E。, and so the only question of this nature still to be decided is the truth of Conjecture 4 , to the effect that E2 is minimal above Eo . Indeed , since E , and E3 are known to be ...
... Theorem we now have that E3 is minimal above E。, and so the only question of this nature still to be decided is the truth of Conjecture 4 , to the effect that E2 is minimal above Eo . Indeed , since E , and E3 are known to be ...
Contents
Set theory generated by Abelian group theory by PAUL C EKLOF | 17 |
On the decision problem for twovariable firstorder logic by ERICH GRÄDEL | 53 |
Paul Erdős 19131996 by JAMES E BAUMGARTNER | 70 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
abstract algebraic algorithm argument-text arithmetic Association for Symbolic axioms Borel equivalence relation bounded cardinality Church Comp compact complete Computer Science concept construction continuous function countable defined definition denote Department of Mathematics domain E-mail editors elements finite model first-order first-order logic fixed point formal formula Germany given Gödel graph implies induction infinite Inst integral interpretation intuitionistic isomorphic Journal of Symbolic lambda calculus language Lecture Notes Lemma linear logic Math Mathematica metric space modal logic model theory natural numbers notation notion ordinal P.O. Box paper Philos predicate presheaf primitive recursive problem programming proof theory propositional provability prove real number recursion theory recursive functions reduction result satisfies semantics sentence sequence set theory Springer-Verlag structure subset Symbolic Logic Tarski theorem thesis topological Turing type theory Univ University USA Dept variables well-ordering Well-Ordering Theorem Zermelo