The Bulletin of Symbolic LogicAssociation for Symbolic Logic, 2000 - Electronic journals |
From inside the book
Results 1-3 of 27
Page 54
... axiomatic theory that is built by adding to fundamental logical forms some other basic forms ( called " axiomatic forms " ) characterised by their decidability , i.e. by the fact that for any Erlebnis it is possible to establish whether ...
... axiomatic theory that is built by adding to fundamental logical forms some other basic forms ( called " axiomatic forms " ) characterised by their decidability , i.e. by the fact that for any Erlebnis it is possible to establish whether ...
Page 55
... axiomatic form ( al- though it can be easily put into an axiomatic form , as Hao Wang did in his 1957 article " The Axiomatization of Arithmetic " ) : that is why König put the expression “ axioms ” , referring to Grassman's work , in ...
... axiomatic form ( al- though it can be easily put into an axiomatic form , as Hao Wang did in his 1957 article " The Axiomatization of Arithmetic " ) : that is why König put the expression “ axioms ” , referring to Grassman's work , in ...
Page 306
... axiomatic method seems difficult to reconcile with the fact that Heyting had two years before defended his Ph . D. thesis , Intuitionistic Axiomatics of Projective Geometry ( not in Fraenkel's bibliography of the Zehn Vorlesungen ) ...
... axiomatic method seems difficult to reconcile with the fact that Heyting had two years before defended his Ph . D. thesis , Intuitionistic Axiomatics of Projective Geometry ( not in Fraenkel's bibliography of the Zehn Vorlesungen ) ...
Contents
Towards a reevaluation of Julius Königs contribution to logic by MIRIAM | 45 |
S Shelah Proper and improper forcing Reviewed by Péter Komjáth | 83 |
Kurt Schütte 19091998 by WOLFRAM POHLERS | 101 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
abstract algebra analysis applications arithmetic Association for Symbolic automorphism axiomatic Boolean Brouwer classical Comp complete computable structure Computer Science condition consistency construction continuum countable decision problem definition Department of Mathematics Dept discussion domain E-mail editors elementary equivalent Euler characteristic example existence Feferman finite first-order formal formula Fraenkel functions Gödel Grothendieck ring hierarchy Hilbert infinite integer interpolation interpretation intuitionism intuitionistic isomorphic Journal of Symbolic language large cardinal axioms lemma machine many-sorted Math mathematical logic Mathematical Society mathematicians measurable cardinals method modal logic model theory natural numbers nonstandard notion number theory o-minimal ordinal P.O. Box paper PENELOPE MADDY Philos Philosophy polynomial predicate principle probability probability amplitudes proof theory properties propositional proved quantifiers quantum computer question real numbers recursive relation semantics sentences sequence set theory subsets Symbolic Logic Tarski theorem type theory Univ University variables Woodin Woodin cardinals