Generic Coding with Help and Amalgamation Failure
Logic
2021-04-08 v3
Abstract
We show that if is a countable transitive model of ZF and if are reals not in , then there is a generic over such that . We then present several applications such as the following: if is any countable transitive model of ZFC and is another countable transitive model of ZFC of the same ordinal height , then there is a forcing extension of such that is not included in any transitive model of ZFC of height . Also, assuming exists, letting be the set of reals generic over , although is disjoint from the Turing cone above , we have that for any non-constructible real , is cofinal in the Turing degrees.
Keywords
Cite
@article{arxiv.1808.10304,
title = {Generic Coding with Help and Amalgamation Failure},
author = {Sy-David Friedman and Dan Hathaway},
journal= {arXiv preprint arXiv:1808.10304},
year = {2021}
}
Comments
14 pages