Degrees of unsolvability of constructible sets of integers

1969 ◽  
Vol 33 (4) ◽  
pp. 497-513 ◽  
Author(s):  
George Boolos ◽  
Hilary Putnam
Keyword(s):  
Fine Structure ◽  
Continuum Hypothesis ◽  
Arithmetical Hierarchy ◽  
Constructible Sets ◽  
Degrees Of Unsolvability ◽  
The Continuum

Why the Post-Kleene arithmetical hierarchy of degrees of (recursive) unsolvability was extended into the transfinite is not clear. Perhaps it was thought that if a hierarchy of sufficiently fine structure could be described that would include all sets of integers, some light might be thrown on the Continuum Hypothesis, and its truth or falsity possibly even ascertained. There is also some evidence in the 1955 papers of Kleene (cf. Kleene [2], [3], [4]) that it was once hoped that a theorem for the analytical hierarchy analogous to the result of Post and Kleene

An addendum to “The work of Kurt Gödel”

1978 ◽  
Vol 43 (3) ◽  
pp. 613-613 ◽  
Author(s):  
Stephen C. Kleene
Keyword(s):  
Set Theory ◽  
Continuum Hypothesis ◽  
Axiom System ◽  
Von Neumann ◽  
Main Achievement ◽  
Constructible Sets ◽  
Kurt Gödel ◽  
The One ◽  
The Axiom Of Choice ◽  
The Continuum

Gödel has called to my attention that p. 773 is misleading in regard to the discovery of the finite axiomatization and its place in his proof of the consistency of GCH. For the version in [1940], as he says on p. 1, “The system Σ of axioms for set theory which we adopt [a finite one] … is essentially due to P. Bernays …”. However, it is not at all necessary to use a finite axiom system. Gödel considers the more suggestive proof to be the one in [1939], which uses infinitely many axioms.His main achievement regarding the consistency of GCH, he says, really is that he first introduced the concept of constructible sets into set theory defining it as in [1939], proved that the axioms of set theory (including the axiom of choice) hold for it, and conjectured that the continuum hypothesis also will hold. He told these things to von Neumann during his stay at Princeton in 1935. The discovery of the proof of this conjecture On the basis of his definition is not too difficult. Gödel gave the proof (also for GCH) not until three years later because he had fallen ill in the meantime. This proof was using a submodel of the constructible sets in the lowest case countable, similar to the one commonly given today.

The constructible universe

2018 ◽  
Author(s):  
John P. Burgess
Keyword(s):  
Set Theory ◽  
Continuum Hypothesis ◽  
Axiom Of Choice ◽  
Constructible Sets ◽  
Kurt Gödel ◽  
The Axiom Of Choice ◽  
The Universe ◽  
The Continuum

the ‘universe’ of constructible sets was introduced by Kurt Gödel in order to prove the consistency of the axiom of choice (AC) and the continuum hypothesis (CH) with the basic (ZF) axioms of set theory. The hypothesis that all sets are constructible is the axiom of constructibility (V = L). Gödel showed that if ZF is consistent, then ZF + V = L is consistent, and that AC and CH are provable in ZF + V = L.

An Elementary Approach to the Fine Structure of L

1997 ◽  
Vol 3 (4) ◽  
pp. 453-468 ◽  
Author(s):  
Sy D. Friedman ◽  
Peter Koepke
Keyword(s):  
Fine Structure ◽  
Set Theory ◽  
Continuum Hypothesis ◽  
Central Place ◽  
Structure Theory ◽  
Original Form ◽  
Elementary Embedding ◽  
Elementary Model ◽  
Image Position ◽  
The Continuum

We present here an approach to the fine structure of L based solely on elementary model theoretic ideas, and illustrate its use in a proof of Global Square in L. We thereby avoid the Lévy hierarchy of formulas and the subtleties of master codes and projecta, introduced by Jensen [3] in the original form of the theory. Our theory could appropriately be called ”Hyperfine Structure Theory”, as we make use of a hierarchy of structures and hull operations which refines the traditional Lα -or Jα-sequences with their Σn-hull operations.§1. Introduction. In 1938, K. Gödel defined the model L of set theory to show the relative consistency of Cantor's Continuum Hypothesis. L is defined as a unionof initial segments which satisfy: L0 = ∅, Lλ = ∪α<λLα for limit ordinals λ, and, crucially, Lα + 1 = the collection of 1st order definable subsets of Lα. Since every transitive model of set theory must be closed under 1st order definability, L turns out to be the smallest inner model of set theory. Thus it occupies the central place in the set theoretic spectrum of models.The proof of the continuum hypothesis in L is based on the very uniform hierarchical definition of the L-hierarchy. The Condensation Lemma states that if π : M → Lα is an elementary embedding, M transitive, then some ; the lemma can be proved by induction on α. If a real, i.e., a subset of ω, is definable over some Lα,then by a Löwenheim-Skolem argument it is definable over some countable M as above, and hence over some , < ω1. This allows one to list the reals in L in length ω1 and therefore proves the Continuum Hypothesis in L.

scholarly journals Several results on compact metrizable spaces in $$\mathbf {ZF}$$

2021 ◽  
Author(s):  
Kyriakos Keremedis ◽  
Eleftherios Tachtsis ◽  
Eliza Wajch
Keyword(s):  
Continuum Hypothesis ◽  
Compact Spaces ◽  
Power Set ◽  
Compact Metrizable Space ◽  
Permutation Models ◽  
Independence Results ◽  
The Axiom Of Choice ◽  
Metrizable Spaces ◽  
Transfer Theorems ◽  
The Continuum

AbstractIn the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $$\mathbf {ZF}$$ ZF , some are shown to be independent of $$\mathbf {ZF}$$ ZF . For independence results, distinct models of $$\mathbf {ZF}$$ ZF and permutation models of $$\mathbf {ZFA}$$ ZFA with transfer theorems of Pincus are applied. New symmetric models of $$\mathbf {ZF}$$ ZF are constructed in each of which the power set of $$\mathbb {R}$$ R is well-orderable, the Continuum Hypothesis is satisfied but a denumerable family of non-empty finite sets can fail to have a choice function, and a compact metrizable space need not be embeddable into the Tychonoff cube $$[0, 1]^{\mathbb {R}}$$ [ 0 , 1 ] R .

Sign in / Sign up

Export Citation Format

Share Document