Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T05:10:40.123Z Has data issue: false hasContentIssue false

Combinatorics on ideals and forcing with trees

Published online by Cambridge University Press:  12 March 2014

Marcia J. Groszek*
Affiliation:
Department of Mathematics, Dartmouth College, Hanover, New Hampshire 03755

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable