Combinatorics on ideals and forcing with trees

1 September 1987

journal article
research article
Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic

Vol. 52 (3) , 582-593
https://doi.org/10.1017/s0022481200029637

Abstract

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.

Keywords

This publication has 7 references indexed in Scilit:

Rational perfect set forcing
Contemporary Mathematics, 1984
ITERATED FORCING
Published by Cambridge University Press (CUP) ,1983
Coding the Universe
Published by Cambridge University Press (CUP) ,1982
Countable admissible ordinals and hyperdegrees
Advances in Mathematics, 1976
On the consistency of Borel's conjecture
Acta Mathematica, 1976
Combinatorics on ideals and forcing
Annals of Mathematical Logic, 1971
Forcing with perfect closed sets
Proceedings of Symposia in Pure Mathematics, 1971