Specialising Trees with Small Approximations I

Journal of Symbolic Logic:1-24 (forthcoming)
  Copy   BIBTEX

Abstract

Assuming $\mathrm{PFA}$, we shall use internally club $\omega _1$ -guessing models as side conditions to show that for every tree T of height $\omega _2$ without cofinal branches, there is a proper and $\aleph _2$ -preserving forcing notion with finite conditions which specialises T. Moreover, the forcing has the $\omega _1$ -approximation property.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Approximations and truth spaces.Jean-Pierre Marquis - 1991 - Journal of Philosophical Logic 20 (4):375 - 401.
The Bayesian Theory of Confirmation, Idealizations and Approximations in Science.Erdinç Sayan - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 37:281-289.
Observations about Scott and Karp trees.Taneli Huuskonen - 1995 - Annals of Pure and Applied Logic 76 (3):201-230.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
VC-density for trees.Anton Bobkov - 2019 - Archive for Mathematical Logic 58 (5-6):587-603.
Forestry and the Art of Frying Small Fish.David Russell - 1998 - Environmental Values 7 (3):281-289.
Analytic cut trees.Carlo Cellucci - 2000 - Logic Journal of the IGPL 8 (6):733-750.
No Time for Time from No-Time.Eugene Y. S. Chua & Craig Callender - 2021 - Philosophy of Science 88 (5):1172-1184.
Antichains of perfect and splitting trees.Paul Hein & Otmar Spinas - 2020 - Archive for Mathematical Logic 59 (3-4):367-388.

Analytics

Added to PP
2022-04-08

Downloads
60 (#266,503)

6 months
59 (#79,810)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Forcing with Sequences of Models of Two Types.Itay Neeman - 2014 - Notre Dame Journal of Formal Logic 55 (2):265-298.
The combinatorial essence of supercompactness.Christoph Weiß - 2012 - Annals of Pure and Applied Logic 163 (11):1710-1717.
Guessing models and generalized Laver diamond.Matteo Viale - 2012 - Annals of Pure and Applied Logic 163 (11):1660-1678.
Quotients of strongly proper forcings and guessing models.Sean Cox & John Krueger - 2016 - Journal of Symbolic Logic 81 (1):264-283.
Squares, ascent paths, and chain conditions.Chris Lambie-Hanson & Philipp Lücke - 2018 - Journal of Symbolic Logic 83 (4):1512-1538.

View all 11 references / Add more references