Forcing axioms for λ‐complete μ+$\mu ^+$‐c.c

Mathematical Logic Quarterly 68 (1):6-26 (2022)
  Copy   BIBTEX

Abstract

We consider forcing axioms for suitable families of μ‐complete ‐c.c. forcing notions. We show that some form of the condition “ have a in ” is necessary. We also show some versions are really stronger than others.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201900020

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

My notes

Similar books and articles

Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
Simple forcing notions and forcing axioms.Andrzej Rosłanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
Simple Forcing Notions and Forcing Axioms.Andrzej Roslanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
Projective well-orderings and bounded forcing axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557-572.
On resurrection axioms.Konstantinos Tsaprounis - 2015 - Journal of Symbolic Logic 80 (2):587-608.
More about λ-support iterations of (<λ)-complete forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2013 - Archive for Mathematical Logic 52 (5-6):603-629.
Aronszajn tree preservation and bounded forcing axioms.Gunter Fuchs - 2021 - Journal of Symbolic Logic 86 (1):293-315.
Hierarchies of resurrection axioms.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):283-325.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Forcing axioms, supercompact cardinals, singular cardinal combinatorics.Matteo Viale - 2008 - Bulletin of Symbolic Logic 14 (1):99-113.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Sweet & sour and other flavours of ccc forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (5):583-663.
Forcing axioms, approachability, and stationary set reflection.Sean D. Cox - 2021 - Journal of Symbolic Logic 86 (2):499-530.
More on simple forcing notions and forcings with ideals.M. Gitik & S. Shelah - 1993 - Annals of Pure and Applied Logic 59 (3):219-238.

Analytics

Added to PP
2022-04-10

Downloads
8 (#1,339,958)

6 months
5 (#703,779)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Different cofinalities of tree ideals.Saharon Shelah & Otmar Spinas - 2023 - Annals of Pure and Applied Logic 174 (8):103290.

Add more citations

References found in this work

Applications of PCF theory.Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (4):1624-1674.
The amalgamation spectrum.John T. Baldwin, Alexei Kolesnikov & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (3):914-928.
Diamonds, uniformization.Saharon Shelah - 1984 - Journal of Symbolic Logic 49 (4):1022-1033.
Simple unstable theories.Saharon Shelah - 1980 - Annals of Mathematical Logic 19 (3):177.
Was sierpinski right? IV.Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (3):1031-1054.

View all 6 references / Add more references