The Bulletin of Symbolic LogicAssociation for Symbolic Logic, 1997 - Electronic journals |
From inside the book
Results 1-3 of 85
Page 98
... E - mail : Peter . Cholak . 1@nd.edu . Department of Mathematics , Victoria University of Wellington , Wellington , New Zealand . E - mail : downey@vuw.ac.nz . Currently there is a lot of research being done to explore the relationship ...
... E - mail : Peter . Cholak . 1@nd.edu . Department of Mathematics , Victoria University of Wellington , Wellington , New Zealand . E - mail : downey@vuw.ac.nz . Currently there is a lot of research being done to explore the relationship ...
Page 365
... E - mail : Allen . Hazen@muwayf.unimelb.edu.au . E - mail : danieln @ coombs . anu.edu.au. Is it conceivable , or metaphysically possible , that there should be some hypergunk ? Hy- pergunk being defined as mereologically atomless stuff ...
... E - mail : Allen . Hazen@muwayf.unimelb.edu.au . E - mail : danieln @ coombs . anu.edu.au. Is it conceivable , or metaphysically possible , that there should be some hypergunk ? Hy- pergunk being defined as mereologically atomless stuff ...
Page 381
... E - mail : byrnes+@andrew.cmu.edu . Sieg developed intercalation calculi ( IC ) for the purpose of searching directly for natural deduction ( ND ) proofs ; these are presented in [ 2 , 3 ] . It is shown that by restricting strategies ...
... E - mail : byrnes+@andrew.cmu.edu . Sieg developed intercalation calculi ( IC ) for the purpose of searching directly for natural deduction ( ND ) proofs ; these are presented in [ 2 , 3 ] . It is shown that by restricting strategies ...
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