Provability, Computability and ReflectionElsevier, 1 avr. 2000 - 634 pages Provability, Computability and Reflection |
Table des matières
Chapter 2 Models of set theory | 177 |
Chapter 3 On the independence of the wellordering theorem from the ordering principle | 290 |
Chapter 4 On definable sets of positive integers | 339 |
Chapter 5 The classical and the ωcomplete arithmetic | 371 |
Chapter 6 Formal system of analysis based on an infinitistic rule of proof | 390 |
Chapter 7 An exposition of forcing | 416 |
Chapter 8 Some impredicative definitions in the axiomatic settheory | 479 |
Chapter 9 Models of axiomatic theories admitting automorphisms | 494 |
Chapter 10 On ωmodels which are not βmodels | 513 |
Chapter 11 Observations concerning elementary extensions of ωmodels I | 524 |
Chapter 12 An undecidable arithmetical statement | 531 |
Chapter 13 On extendability of models of ZF set theory to the models of KelleyMorse theory of classes | 553 |
Expressions et termes fréquents
5-distinguished arbitrary arithmetic assume atomic formulae automorphisms axiom of choice axiom of constructibility axiomatic belongs calculus called cardinal computable functions consistent constant contains continuum hypothesis defined definition denote denumerable domain elementarily equivalent elementary elements equivalent exists extendable formal formula F free variables Fundamenta Mathematicae Gödel Hence infer infinite infinitistic interpretation intuitionistic logic isomorphic Journal of Symbolic Kleene language lecture lemma limit number Math maximal filter method model of ZF model theory Mostowski notion obtain ordinal number paper predicate primitive recursive function propositional function provable proved quantifiers recursively enumerable sets relation semantics sentences set theory set-theoretical sets of integers subsets Symbolic Logic Tarski tion transfinite true undecidability valid well-ordering