Classes of forcings which add a real by forcing with branching conditions are examined, and conditions are found which guarantee that the generic real is of minimal degree over the ground model. An application is made to almost-disjoint coding via a real of minimal degree.
Publié le : 1987-09-14
Classification:
Forcing,
trees,
ideals,
minimal degrees,
degrees of constructibility,
almost-disjoint coding
@article{1183742430,
author = {Groszek, Marcia J.},
title = {Combinatorics on Ideals and Forcing with Trees},
journal = {J. Symbolic Logic},
volume = {52},
number = {1},
year = {1987},
pages = { 582-593},
language = {en},
url = {http://dml.mathdoc.fr/item/1183742430}
}
Groszek, Marcia J. Combinatorics on Ideals and Forcing with Trees. J. Symbolic Logic, Tome 52 (1987) no. 1, pp. 582-593. http://gdmltest.u-ga.fr/item/1183742430/