Provability, Computability and ReflectionProvability, Computability and Reflection |
Contents
| 1 | |
Chapter 2 Determinacy and prewellorderings of the continuum | 24 |
A survey | 63 |
Chapter 4 Some applications of almost disjoint sets | 84 |
Chapter 5 On local arithmetical functions and their application for constructing types of peanos arithmetic | 105 |
Chapter 6 Definable sets of minimal degree | 122 |
Chapter 7 Definability in axiomatic set theory II | 129 |
Common terms and phrases
A-run A₁ A₂ assume automaton axiom of choice b₁ binary relation cardinal choice subfunction closure properties Cod(A Cod(g codes conjecture consistent constructible COROLLARY countable transitive model definition degrees of unsolvability denote distributive lattice domain E-trees element elementary submodel exists extension finite tree follows formula Ft(E G₁ hence implies induction infinite initial segment isomorphism Lemma length Let G limit ordinal M-generic filter Mahlo mapping Math measurable cardinals minimal degree model of ZFC N₁ natural numbers obtained order-type ordinal ordinal-definable p.o. set parametrized partial function Peano's arithmetic pre-dense predicate prewellordering prewellordering property proof of Lemma proof of Theorem provably prove quantifiers r₁ real numbers regular cardinal result Rn(A s.f.a. definable Sacks satisfies second-order theory set of integers set of real set theory Shoenfield Solovay special automata surjection t₁ t₂ w₁ weakly definable well-ordering Y₁