HIERARCHIES OF (VIRTUAL) RESURRECTION AXIOMS

@article{Fuchs2018HIERARCHIESO,
  title={HIERARCHIES OF (VIRTUAL) RESURRECTION AXIOMS},
  author={Gunter Fuchs},
  journal={The Journal of Symbolic Logic},
  year={2018},
  volume={83},
  pages={283 - 325}
}
  • G. Fuchs
  • Published 1 March 2018
  • Economics
  • The Journal of Symbolic Logic
Abstract I analyze the hierarchies of the bounded resurrection axioms and their “virtual” versions, the virtual bounded resurrection axioms, for several classes of forcings (the emphasis being on the subcomplete forcings). I analyze these axioms in terms of implications and consistency strengths. For the virtual hierarchies, I provide level-by-level equiconsistencies with an appropriate hierarchy of virtual partially super-extendible cardinals. I show that the boldface resurrection axioms for… 
6 Citations
COMBINING RESURRECTION AND MAXIMALITY
Abstract It is shown that the resurrection axiom and the maximality principle may be consistently combined for various iterable forcing classes. The extent to which resurrection and maximality
SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS
TLDR
It is shown that subcomplete forcing cannot add a new branch to an ω1-tree, and the relationships between bounded forcing axioms, preservation of Aronszajn trees of height and widthπ1 and generic absoluteness of ${\rm{\Sigma }}_1^1$-statements over first order structures of sizeπ1 are explored.
Canonical fragments of the strong reflection principle
  • G. Fuchs
  • Environmental Science
    J. Math. Log.
  • 2021
For an arbitrary forcing class [Formula: see text], the [Formula: see text]-fragment of Todorčević’s strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for [Formula:
Virtual large cardinals
Subcomplete forcing principles and definable well‐orders
TLDR
Enhanced version of bounded forcing axioms are introduced that are strong enough to have the implications of the maximality principles mentioned above.
Diagonal reflections on squares
TLDR
It is shown that a diagonal reflection principle, DSR, implies the failure of weak threaded square principles, for every regular $$\lambda >\omega _1$$λ>ω1, and that this result is sharp.

References

SHOWING 1-10 OF 59 REFERENCES
ON RESURRECTION AXIOMS
TLDR
A stronger form of resurrection is introduced and it is shown that it gives rise to families of axioms which are consistent relative to extendible cardinals, and which imply the strongest known instances of forcing axiomatic, such as Martin’s Maximum++.
HIERARCHIES OF FORCING AXIOMS, THE CONTINUUM HYPOTHESIS AND SQUARE PRINCIPLES
  • G. Fuchs
  • Economics
    The Journal of Symbolic Logic
  • 2018
TLDR
It is shown that the subcomplete forcing axiom implies Larson’s ordinal reflection principle at ω 2, and that its effect on the failure of weak squares is very similar to that of Martin's Maximum.
Resurrection axioms and uplifting cardinals
TLDR
The resurrection axioms are introduced and the uplifting cardinals are proved to be a new large cardinal notion and it is proved that various instances of the resurrection axIoms are equiconsistent over ZFC with the existence of an uplifting cardinal.
On Subcomplete Forcing
I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make
Strongly uplifting cardinals and the boldface resurrection axioms
TLDR
The strongly uplifting cardinals are introduced, and it is shown that their existence is equiconsistent over ZFC with natural instances of the boldface resurrection axiom, such as theboldface resurrected axiom for proper forcing.
Bounded forcing axioms as principles of generic absoluteness
TLDR
It is shown that Bounded Forcing Axioms imply a strong form of generic absoluteness for projective sentences, namely, if a $\Sigma^1_3$ sentence with parameters is forceable, then it is true.
Subcomplete Forcing and L-Forcing
ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are
The Bounded Proper Forcing Axiom
TLDR
The bounded proper forcing axiom BPFA is equivalent to the statement that two nonisomorphic models of size @1 cannot be made isomorphic by a proper forcing notion, and the consistency strength of the bounded properforcing axiom is exactly the existence of a §1-re∞ecting cardinal.
Subtle and Ineffable Tree Properties
In the style of the tree property, we give combinatorial principles that capture the concepts of the so-called subtle and ineffable cardinals in such a way that they are also applicable to small
Closed maximality principles: implications, separations and combinations
  • G. Fuchs
  • Mathematics
    Journal of Symbolic Logic
  • 2008
TLDR
An application to the automorphism tower problem is given, showing that there are Souslin trees which are able to realize any equivalence relation, and hence thatthere are groups whose automorphic tower is highly sensitive to forcing.
...
...