An elementary approach to the fine structure of L

Bulletin of Symbolic Logic 3 (4):453-468 (1997)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
34 (#479,810)

6 months
10 (#299,297)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Set forcing and strong condensation for H.Liuzhen Wu - 2015 - Journal of Symbolic Logic 80 (1):56-84.
1998 European Summer Meeting of the Association for Symbolic Logic.S. Buss - 1999 - Bulletin of Symbolic Logic 5 (1):59-153.
Global square and mutual stationarity at the ℵn.Peter Koepke & Philip D. Welch - 2011 - Annals of Pure and Applied Logic 162 (10):787-806.
Square below a non-weakly compact cardinal.Hazel Brickhill - 2020 - Archive for Mathematical Logic 59 (3-4):409-426.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.

Add more references