Mathematics > Logic
This paper has been withdrawn by Rahman Mohammadpour
[Submitted on 1 Jun 2022 (v1), last revised 18 Jul 2023 (this version, v2)]
Title:Specialising Trees With Small Approximations II
No PDF available, click to view other formatsAbstract:We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of side conditions to show that the existence of such ideals is consistent with stationarily many appropriate guessing models. These objects suffice to extend the main theorem of \cite{mhpr_spe}: one can generically specialise any branchless tree of height $\kappa^{++}$ with a ${<}\kappa$-closed, $\kappa^{+}$-proper, and $\kappa^{++}$-preserving forcing, which has the $\kappa^+$-approximation property.
Submission history
From: Rahman Mohammadpour [view email][v1] Wed, 1 Jun 2022 16:31:53 UTC (24 KB)
[v2] Tue, 18 Jul 2023 16:49:32 UTC (1 KB) (withdrawn)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.