Provability, Computability and Reflection

Front Cover
Elsevier, Apr 1, 2000 - Mathematics - 634 pages
0 Reviews
Provability, Computability and Reflection
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

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
Copyright

Common terms and phrases

Bibliographic information