Constructibility (Q3329455)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3861143
Language Label Description Also known as
default for all languages
No label defined
    English
    Constructibility
    scientific article; zbMATH DE number 3861143

      Statements

      1984
      0 references
      Generalized Continuum Hypothesis
      0 references
      Axiom of Choice
      0 references
      constructible sets
      0 references
      constructible hierarchy
      0 references
      constructible universe
      0 references
      Fine Structure of L
      0 references
      combinatorial principles
      0 references
      Silver machines
      0 references
      large cardinals
      0 references
      covering Theorem
      0 references
      morasses
      0 references
      0 references
      Constructibility (English)
      0 references
      In Zermelo-Fraenkel Set Theory, the concept of a ''set'' is related to a cumulative hierarchy obtained by transfinite iteration of (unrestricted) power set operation. To prove the consistency of the Generalized Continuum Hypothesis and the Axiom of Choice, K. Gödel (1938) restricted the set-theoretic universe to the class L of so called constructible sets. The constructible hierarchy \(L_{\alpha}\) for L is based on the power set operation restricted to subsets which are definable in a certain definite sense. The constructible universe L is an inner model of Set Theory in which both the Generalized Continuum Hypothesis and the Axiom of Choice hold. Later, Gödel showed that the class L and the sets \(L_{\alpha}\) can be alternatively described as closures with respect to a finite number of simple set-theoretic operations. This approach attained its maturity more than twenty years later due to impressive work of R. B. Jensen. To grasp the details of the Structure of constructible sets, Jensen defined a new hierarchy for L based on a balanced combination of recursion-theoretic and model- theoretic methods. The hierarchy is now called Fine Structure of L. Jensen was able to select a number of combinatorial principles (e.g. \(\diamond\), \(\square_{\kappa}\), morasses) which hold in L and have many important set-theoretic conclusions. The Fine Structure of L was used as a tool in the proof of Jensen's Covering Theorem characterizing the relationship between L and the whole set-theoretic universe V provided that there are no really ''large'' cardinals in V. This was one of the most important results of Set Theory in 1970's. Later, J. Silver gave another proof of the Covering Theorem without any explicit use of sophisticated techniques of the Fine Structure. So called Silver machines represent still another approach to L. The book under review is the full exposition on the subject by Devlin. It is divided into two parts. The first one explains the elementary theory of L in five Chapters. It describes the original constructible hierarchy of sets \(L_{\alpha}\) with the proof of the Generalized Continuum Hypothesis and the Axiom of Choice in L. It gives the story of the combinatorial principles \(\diamond\) and \(\square_{\kappa}\) on one hand and the Souslin and Kurepa trees on the other hand. The relationship of large cardinals to L and the proof of the Covering Theorem are given with some recourses to facts about the Fine Structure of L. The second part gives the advanced theory of L. It explains the intricate details of the Fine Structure and its applications to more sophisticated combinatorial principles like morasses. Silver machines are introduced in the last Chapter and are used in the proof of the principle \(\square_{\kappa}\) in L. Historical remarks, bibliography and index conclude the book, which is the most complete exposition of the constructible universe to this date. It is likely to become the standard reference on the subject.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references