Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-19T05:51:08.432Z Has data issue: false hasContentIssue false

An Elementary Approach to the Fine Structure of L

Published online by Cambridge University Press:  15 January 2014

Sy D. Friedman
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology Cambridge, MA 02139, USA.E-mail: sdf@math.mit.edu
Peter Koepke
Affiliation:
Mathematisches Institut, Universität Bonn, Beringstrasse 4, D-53115 Bonn, Germany.E-mail: koepke@math.uni-bonn.de

Extract

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 union

of 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 π : MLα 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.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Devlin, Keith J., Constructibility, Springer-Verlag, 1984.Google Scholar
[2] Friedman, Sy D., The Σ* approach to the fine structure of L, Fundamenta Mathematicae, to appear.Google Scholar
[3] Jensen, Ronald B., The fine structure of the constructible hierarchy, Annals of Mathematical Logic, vol. 4 (1972), pp. 229308.Google Scholar
[4] Magidor, Menachem, Representing sets of ordinals as countable unions of sets in the core model, Transactions of the American Mathematical Society, vol. 317 (1990), no. 1, pp. 91126.Google Scholar
[5] Richardson, Thomas L., Silver machine approach to the constructible universe, Ph.D. thesis , University of California, Berkeley, 1978.Google Scholar
[6] Silver, Jack H., How to eliminate the fine structure from the work of Jensen, handwritten manuscript, 197?Google Scholar