A guide to “Coding the universe” by Beller, Jensen, Welch (Q3720591)
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 3950518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A guide to “Coding the universe” by Beller, Jensen, Welch |
scientific article; zbMATH DE number 3950518 |
Statements
A guide to “Coding the universe” by Beller, Jensen, Welch (English)
0 references
1985
0 references
almost disjoint forcing
0 references
constructible universe
0 references
Jensen's coding theorem
0 references
0.8790075778961182
0 references
0.81563401222229
0 references
0.7794703841209412
0 references
0.7787509560585022
0 references
Jensen's coding theorem [\textit{A. Beller}, \textit{R. Jensen} and \textit{P. Welch}: ''Coding the universe'' (1982; Zbl 0468.03031)] states the following: If A is a class of ordinals, then there is a forcing \({\mathbb{P}}\) definable over \(<L[A],A>\) such that \({\mathbb{P}}\Vdash V=L[a]\), \(a\subseteq \omega\), and A is definable from a. Moreover, \({\mathbb{P}}\Vdash ''O^{\#}\) does not exist'' whenever \(O^{\#}\not\in L[A].\) The paper under review gives an outline of Jensen's proof for the case \(O^{\#}\not\in L[A]\), with clear motivation for many of its elaborate technical details, and offers simplifications which make distinguishing of the cases \(O^{\#}\in L[A]\) and \(O^{\#}\not\in L[A]\) unnecessary.
0 references