Minimal coding (Q1117220)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal coding |
scientific article; zbMATH DE number 4091492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal coding |
scientific article; zbMATH DE number 4091492 |
Statements
Minimal coding (English)
0 references
1989
0 references
It is shown that the real in Jensen's coding theorem can be minimal over the model to be coded. The almost-disjoint forcing part in Jensen's proof is replaced by some kind of perfect set forcing. Before giving the rather involved proof the author gives the special cases when the set to be minimally coded is a subset of \(\omega_ 1\), \(\omega_ 2\), or \(\omega_{\omega +1}\), respectively.
0 references
forcing by perfect trees
0 references
adding minimal reals
0 references
Jensen's coding theorem
0 references
