Creature forcing and large continuum: the joy of halving

Archive for Mathematical Logic 51 (1-2):49-70 (2012)
  Copy   BIBTEX

Abstract

For \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f,g\in\omega^\omega}$$\end{document} let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\forall_{f,g}}$$\end{document} be the minimal number of uniform g-splitting trees needed to cover the uniform f-splitting tree, i.e., for every branch ν of the f-tree, one of the g-trees contains ν. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\exists_{f,g}}$$\end{document} be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that it is consistent that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\exists_{f_\epsilon,g_\epsilon}{=}c^\forall_{f_\epsilon,g_\epsilon}{=}\kappa_\epsilon}$$\end{document} for continuum many pairwise different cardinals \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa_\epsilon}$$\end{document} and suitable pairs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(f_\epsilon,g_\epsilon)}$$\end{document}. For the proof we introduce a new mixed-limit creature forcing construction.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

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

Two-cardinal diamond and games of uncountable length.Pierre Matet - 2015 - Archive for Mathematical Logic 54 (3-4):395-412.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.
Isomorphic and strongly connected components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.

Analytics

Added to PP
2013-10-27

Downloads
49 (#451,272)

6 months
12 (#308,345)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Many simple cardinal invariants.Martin Goldstern & Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (3):203-221.
Decisive creatures and large continuum.Jakob Kellner & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (1):73-104.
Even more simple cardinal invariants.Jakob Kellner - 2008 - Archive for Mathematical Logic 47 (5):503-515.

Add more references