What people are saying - Write a review
We haven't found any reviews in the usual places.
THE THEORY OF SETS 1 Enumerable sets 2 Cantors diagonal method 3 Cardinal number
4 The equivalence theorem finite and infinite sets
Higher transfinite cardinals
83 other sections not shown
Other editions - View all
additional applied arithmetic Axiom Schema axioms bound Chapter classical completely computable conclusion consider consistency constant constructed containing Corollary corresponding decision deduction defined definition depends distinct domain effectively entities enumerable equality equations equivalent establish EXAMPLE exists expressed extended finite formal system give given Gödel number Hence hold hypothesis induction inference infinite interpretation intuitionistic Lemma letter formula logical machine mathematics means metamathematical method natural numbers notion number-theoretic objects obtain occur operation partial recursive particular postulates predicate calculus predicate letter present primitive recursive problem procedure proof proposition proposition letter propositional calculus provable prove quantifiers realizes recursive function Remark replace representing respectively result rules satisfied sense sequence Similarly simply situation square step substitution Suppose symbols Theorem theory true variables VxA(x