Abstract
If B is a relational structure, define P(B) the partial order of all substructures of B that are isomorphic to it. Improving a result of Kurilić and the second author, we prove that if R is the random graph, then P(R) is forcing equivalent to S⁎R˙, where S is Sacks forcing and R˙ is an ω-distributive forcing that is not forcing equivalent to a σ-closed one. We also prove that P(H3) is forcing equivalent to a σ-closed forcing, where H3 is the generic triangle-free graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
