Article contents
Combinatorics on ideals and forcing with trees
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1987
References
REFERENCES
- 6
- Cited by