We construct creature forcings with strong Axiom A that specialize a given Aronszajn tree. We work with tree creature forcing. The creatures that live on the Aronszajn tree are normed and have the halving property. We show that our models fulfill ℵ1=d

Set Theory in Philosophy of Mathematics

Direct download (3 more)  

 

Export citation  

 

Bookmark  

We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.

Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.

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_\e psilon}$$\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. (shrink)

We use a creature construction to show that consistently $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$The same method shows the consistency of $$\begin{aligned} \mathfrak d=\aleph _1= {{\mathrm{cov}}}< {{\mathrm{non}}}< {{\mathrm{non}}}< {{\mathrm{cof}}} < 2^{\aleph _0}. \end{aligned}$$.