Results for 'semiproper forcing axiom'

995 found
Order:
  1. Semiproper forcing axiom implies Martin maximum but not PFA+.Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):360-367.
    We prove that MM (Martin maximum) is equivalent (in ZFC) to the older axiom SPFA (semiproper forcing axiom). We also prove that SPFA does not imply SPFA + or even PFA + (using the consistency of a large cardinal).
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  2.  18
    Removing Laver functions from supercompactness arguments.Arthur W. Apter - 2005 - Mathematical Logic Quarterly 51 (2):154.
    We show how the use of a Laver function in the proof of the consistency, relative to the existence of a supercompact cardinal, of both the Proper Forcing Axiom and the Semiproper Forcing Axiom can be eliminated via the use of lottery sums of the appropriate partial orderings.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
    Let T be an $\omega_{1}-Souslin$ tree. We show the property of forcing notions; "is $\lbrace\omega_{1}\rbrace-semi-proper$ and preserves T" is preserved by a new kind of revised countable support iteration of arbitrary length. As an application we have a forcing axiom which is compatible with the existence of an $\omega_{1}-Souslin$ tree for preorders as wide as possible.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  28
    Bounded Martin's Maximum, Weak [image] Cardinals, and [image].David Asperó & Philip D. Welch - 2002 - Journal of Symbolic Logic 67 (3):1141 - 1152.
    We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  19
    On a convenient property about $${[\gamma]^{\aleph_0}}$$.David Asperó - 2009 - Archive for Mathematical Logic 48 (7):653-677.
    Several situations are presented in which there is an ordinal γ such that ${\{ X \in [\gamma]^{\aleph_0} : X \cap \omega_1 \in S\,{\rm and}\, ot(X) \in T \}}$ is a stationary subset of ${[\gamma]^{\aleph_0}}$ for all stationary ${S, T\subseteq \omega_1}$ . A natural strengthening of the existence of an ordinal γ for which the above conclusion holds lies, in terms of consistency strength, between the existence of the sharp of ${H_{\omega_2}}$ and the existence of sharps for all reals. Also, an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  4
    On a convenient property about \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${[\gamma]^{\aleph_0}}$$\end{document}. [REVIEW]David Asperó - 2009 - Archive for Mathematical Logic 48 (7):653-677.
    Several situations are presented in which there is an ordinal γ such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{ X \in [\gamma]^{\aleph_0} : X \cap \omega_1 \in S\,{\rm and}\, ot(X) \in T \}}$$\end{document} is a stationary subset of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${[\gamma]^{\aleph_0}}$$\end{document} for all stationary \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${S, T\subseteq \omega_1}$$\end{document}. A natural strengthening of the existence of an ordinal γ for which the above (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  9
    Forcing axioms and coronas of C∗-algebras.Paul McKenney & Alessandro Vignati - 2021 - Journal of Mathematical Logic 21 (2):2150006.
    We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable [Formula: see text]-algebras with the metric approximation property and an increasing approximate identity of projections.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  6
    Forcing axioms and coronas of C∗-algebras.Paul McKenney & Alessandro Vignati - 2021 - Journal of Mathematical Logic 21 (2):2150006.
    We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable [Formula: see text]-algebras with the metric approximation property and an increasing approximate identity of projections.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  8
    Forcing axioms for λ‐complete μ+$\mu ^+$‐c.c.Saharon Shelah - 2022 - Mathematical Logic Quarterly 68 (1):6-26.
    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.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  34
    Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
    We show that Bounded Forcing Axioms (for instance, Martin's Axiom, the Bounded Proper Forcing Axiom, or the Bounded Martin's Maximum) are equivalent to principles of generic absoluteness, that is, they assert that if a $\Sigma_1$ sentence of the language of set theory with parameters of small transitive size is forceable, then it is true. We also show that Bounded Forcing Axioms imply a strong form of generic absoluteness for projective sentences, namely, if a $\Sigma^1_3$ sentence (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  11.  36
    Forcing axioms, supercompact cardinals, singular cardinal combinatorics.Matteo Viale - 2008 - Bulletin of Symbolic Logic 14 (1):99-113.
    The purpose of this communication is to present some recent advances on the consequences that forcing axioms and large cardinals have on the combinatorics of singular cardinals. I will introduce a few examples of problems in singular cardinal combinatorics which can be fruitfully attacked using ideas and techniques coming from the theory of forcing axioms and then translate the results so obtained in suitable large cardinals properties.The first example I will treat is the proof that the proper (...) axiom PFA implies the singular cardinal hypothesis SCH, this will easily lead to a new proof of Solovay's theorem that SCH holds above a strongly compact cardinal. I will also outline how some of the ideas involved in these proofs can be used as means to evaluate the “saturation” properties of models of strong forcing axioms like MM or PFA.The second example aims to show that the transfer principle ↠ fails assuming Martin's Maximum MM. Also in this case the result can be translated in a large cardinal property, however this requires a familiarity with a rather large fragment of Shelah's pcf-theory.Only sketchy arguments will be given, the reader is referred to the forthcoming [25] and [38] for a thorough analysis of these problems and for detailed proofs. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12.  11
    Forcing axioms, approachability, and stationary set reflection.Sean D. Cox - 2021 - Journal of Symbolic Logic 86 (2):499-530.
    We prove a variety of theorems about stationary set reflection and concepts related to internal approachability. We prove that an implication of Fuchino–Usuba relating stationary reflection to a version of Strong Chang’s Conjecture cannot be reversed; strengthen and simplify some results of Krueger about forcing axioms and approachability; and prove that some other related results of Krueger are sharp. We also adapt some ideas of Woodin to simplify and unify many arguments in the literature involving preservation of forcing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  15
    A forcing axiom for a non-special Aronszajn tree.John Krueger - 2020 - Annals of Pure and Applied Logic 171 (8):102820.
    Suppose that T^∗ is an ω_1-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA(T^∗) for proper forcings which preserve these properties of T^∗. We prove that PFA(T^∗) implies many of the strong consequences of PFA, such as the failure of very weak club guessing, that all of the cardinal characteristics of the continuum are greater than ω_1, and the P-ideal dichotomy. On the other hand, PFA(T^∗) implies some of the consequences of diamond principles, such as (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  34
    Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
    In this paper, we study the forcing axiom for the class of proper forcing notions which do not add ω sequence of ordinals. We study the relationship between this forcing axiom and many cardinal invariants. We use typical iterated forcing with large cardinals and analyse certain property being preserved in this process. Lastly, we apply the results to distinguish several forcing axioms.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  37
    The Bounded Axiom A Forcing Axiom.Thilo Weinert - 2010 - Mathematical Logic Quarterly 56 (6):659-665.
    We introduce the Bounded Axiom A Forcing Axiom . It turns out that it is equiconsistent with the existence of a regular ∑2-correct cardinal and hence also equiconsistent with BPFA. Furthermore we show that, if consistent, it does not imply the Bounded Proper Forcing Axiom.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  22
    Bounded forcing axioms and the continuum.David Asperó & Joan Bagaria - 2001 - Annals of Pure and Applied Logic 109 (3):179-203.
    We show that bounded forcing axioms are consistent with the existence of -gaps and thus do not imply the Open Coloring Axiom. They are also consistent with Jensen's combinatorial principles for L at the level ω2, and therefore with the existence of an ω2-Suslin tree. We also show that the axiom we call BMM3 implies 21=2, as well as a stationary reflection principle which has many of the consequences of Martin's Maximum for objects of size 2. Finally, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  17.  21
    Incompatible bounded category forcing axioms.David Asperó & Matteo Viale - 2022 - Journal of Mathematical Logic 22 (2).
    Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We introduce bounded category forcing axioms for well-behaved classes [math]. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe [math] modulo forcing in [math], for some cardinal [math] naturally associated to [math]. These axioms naturally extend projective absoluteness for arbitrary set-forcing — in this situation [math] — to classes [math] with [math]. Unlike projective absoluteness, these (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  8
    Forcing Axioms and the Definability of the Nonstationary Ideal on the First Uncountable.Stefan Hoffelner, Paul Larson, Ralf Schindler & W. U. Liuzhen - forthcoming - Journal of Symbolic Logic:1-18.
    We show that under $\mathsf {BMM}$ and “there exists a Woodin cardinal, $"$ the nonstationary ideal on $\omega _1$ cannot be defined by a $\Pi _1$ formula with parameter $A \subset \omega _1$. We show that the same conclusion holds under the assumption of Woodin’s $(\ast )$ -axiom. We further show that there are universes where $\mathsf {BPFA}$ holds and $\text {NS}_{\omega _1}$ is $\Pi _1(\{\omega _1\})$ -definable. Lastly we show that if the canonical inner model with one Woodin (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  26
    The Proper Forcing Axiom and the Singular Cardinal Hypothesis.Matteo Viale - 2006 - Journal of Symbolic Logic 71 (2):473 - 479.
    We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  20.  17
    Hierarchies of forcing axioms, the continuum hypothesis and square principles.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):256-282.
    I analyze the hierarchies of the bounded and the weak bounded forcing axioms, with a focus on their versions for the class of subcomplete forcings, in terms of implications and consistency strengths. For the weak hierarchy, I provide level-by-level equiconsistencies with an appropriate hierarchy of partially remarkable cardinals. I also show 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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21.  30
    Forcing Axioms, Finite Conditions and Some More.Mirna Džamonja - 2013 - In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 17--26.
  22.  79
    The bounded proper forcing axiom.Martin Goldstern & Saharon Shelah - 1995 - Journal of Symbolic Logic 60 (1):58-73.
    The bounded proper forcing axiom BPFA is the statement that for any family of ℵ 1 many maximal antichains of a proper forcing notion, each of size ℵ 1 , there is a directed set meeting all these antichains. A regular cardinal κ is called Σ 1 -reflecting, if for any regular cardinal χ, for all formulas $\varphi, "H(\chi) \models`\varphi'"$ implies " $\exists\delta . We investigate several algebraic consequences of BPFA, and we show that the consistency strength (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  23.  40
    Woodin's axiom , bounded forcing axioms, and precipitous ideals on ω 1.Benjamin Claverie & Ralf Schindler - 2012 - Journal of Symbolic Logic 77 (2):475-498.
    If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at N₂ with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC-model. This yields that if Woodin's ℙ max axiom (*) holds, then BPFA implies that V is closed under the "Woodin-in-the-next-ZFC-model" operator. We also discuss stronger Mouse Reflection principles which we show to follow from strengthenings of BPFA, and we discuss the theory BPFA plus "NS ω1 is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  24.  6
    Forcing axioms and the uniformization-property.Stefan Hoffelner - 2024 - Annals of Pure and Applied Logic 175 (10):103466.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  11
    Forcing Axioms and Ω-logic.Teruyuki Yorioka - 2009 - Journal of the Japan Association for Philosophy of Science 36 (2):45-52.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  12
    Bounded Namba forcing axiom may fail.Jindrich Zapletal - 2018 - Mathematical Logic Quarterly 64 (3):170-172.
    We show that in a σ‐closed forcing extension, the bounded forcing axiom for Namba forcing fails. This answers a question of J. T. Moore.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  9
    Forcing axiom failure for any λ>ℵ1.Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (3):285-295.
  28.  9
    Forcing axiom failure for any λ>ℵ1.Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (3):285-295.
  29.  11
    Forcing axioms via ground model interpretations.Christopher Henney-Turner & Philipp Schlicht - 2023 - Annals of Pure and Applied Logic 174 (6):103260.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  45
    A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
    After presenting a general setting in which to look at forcing axioms, we give a hierarchy of generalized bounded forcing axioms that correspond level by level, in consistency strength, with the members of a natural hierarchy of large cardinals below a Mahlo. We give a general construction of models of generalized bounded forcing axioms. Then we consider the bounded forcing axiom for a class of partially ordered sets Γ 1 such that, letting Γ 0 be (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  51
    The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal.W. Hugh Woodin - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
  32.  32
    Hierarchies of Forcing Axioms II.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):522 - 542.
    A $\Sigma _{1}^{2}$ truth for λ is a pair 〈Q, ψ〉 so that Q ⊆ Hλ, ψ is a first order formula with one free variable, and there exists B ⊆ Hλ+ such that (Hλ+; ε, B) $(H_{\lambda +};\in ,B)\vDash \psi [Q]$ . A cardinal λ is $\Sigma _{1}^{2}$ indescribable just in case that for every $\Sigma _{1}^{2}$ truth 〈Q, ψ〉 for λ, there exists $\overline{\lambda}<\lambda $ so that $\overline{\lambda}$ is a cardinal and $\langle Q\cap H_{\overline{\lambda}},\psi \rangle $ is a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  9
    Morasses, square and forcing axioms.Charles Morgan - 1996 - Annals of Pure and Applied Logic 80 (2):139-163.
    The paper discusses various relationships between the concepts mentioned in the title. In Section 1 Todorcevic functions are shown to arise from both morasses and square. In Section 2 the theme is of supplements to morasses which have some of the flavour of square. Distinctions are drawn between differing concepts. In Section 3 forcing axioms related to the ideas in Section 2 are discussed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  28
    The proper forcing axiom, Prikry forcing, and the singular cardinals hypothesis.Justin Tatch Moore - 2006 - Annals of Pure and Applied Logic 140 (1):128-132.
    The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping Reflection Principle, a consequence of PFA. While the results fall short of showing that MRP implies SCH, it will be shown that MRP implies that if SCH fails first at κ then every stationary subset of reflects. It will also (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35. On the equivalence of certain consequences of the proper forcing axiom.Peter Nyikos & Leszek Piątkiewicz - 1995 - Journal of Symbolic Logic 60 (2):431-443.
    We prove that a number of axioms, each a consequence of PFA (the Proper Forcing Axiom) are equivalent. In particular we show that TOP (the Thinning-out Principle as introduced by Baumgartner in the Handbook of set-theoretic topology), is equivalent to the following statement: If I is an ideal on ω 1 with ω 1 generators, then there exists an uncountable $X \subseteq \omega_1$ , such that either [ X] ω ∩ I = ⊘ or $\lbrack X\rbrack^\omega \subseteq I$.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  36.  54
    Hierarchies of forcing axioms I.Itay Neeman & Ernest Schimmerling - 2008 - Journal of Symbolic Logic 73 (1):343-362.
    We prove new upper bound theorems on the consistency strengths of SPFA (θ), SPFA(θ-linked) and SPFA(θ⁺-cc). Our results are in terms of (θ, Γ)-subcompactness, which is a new large cardinal notion that combines the ideas behind subcompactness and Γ-indescribability. Our upper bound for SPFA(c-linked) has a corresponding lower bound, which is due to Neeman and appears in his follow-up to this paper. As a corollary, SPFA(c-linked) and PFA(c-linked) are each equiconsistent with the existence of a $\Sigma _{1}^{2}$ -indescribable cardinal. Our (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  59
    Simple forcing notions and forcing axioms.Andrzej Rosłanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
  38.  23
    Operations, climbability and the proper forcing axiom.Yasuo Yoshinobu - 2013 - Annals of Pure and Applied Logic 164 (7-8):749-762.
    In this paper we show that the Proper Forcing Axiom is preserved under forcing over any poset PP with the following property: In the generalized Banach–Mazur game over PP of length , Player II has a winning strategy which depends only on the current position and the ordinal indicating the number of moves made so far. By the current position we mean: The move just made by Player I for a successor stage, or the infimum of all (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  25
    Gap structure after forcing with a coherent Souslin tree.Carlos Martinez-Ranero - 2013 - Archive for Mathematical Logic 52 (3-4):435-447.
    We investigate the effect after forcing with a coherent Souslin tree on the gap structure of the class of coherent Aronszajn trees ordered by embeddability. We shall show, assuming the relativized version PFA(S) of the proper forcing axiom, that the Souslin tree S forces that the class of Aronszajn trees ordered by the embeddability relation is universal for linear orders of cardinality at most ${\aleph_1}$.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  12
    Aronszajn tree preservation and bounded forcing axioms.Gunter Fuchs - 2021 - Journal of Symbolic Logic 86 (1):293-315.
    I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma $ : the hierarchy of bounded forcing axioms, of $\Sigma ^1_1$ -absoluteness, and of Aronszajn tree preservation principles. The latter principle at level $\kappa $ says that whenever T is a tree of height $\omega _1$ and width $\kappa $ that does not have a branch of order type $\omega _1$, and whenever ${\mathord {\mathbb P}}$ is a forcing notion in $\Gamma $, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  13
    Definable MAD families and forcing axioms.Vera Fischer, David Schrittesser & Thilo Weinert - 2021 - Annals of Pure and Applied Logic 172 (5):102909.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  16
    Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
    In the absence of Woodin cardinals, fine structural inner models for mild large cardinal hypotheses admit forcing extensions where bounded forcing axioms hold and yet the reals are projectively well-ordered.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  43.  31
    The ⁎-variation of the Banach–Mazur game and forcing axioms.Yasuo Yoshinobu - 2017 - Annals of Pure and Applied Logic 168 (6):1335-1359.
  44. REVIEWS-The axiom of determinacy, forcing axioms, and the nonstationary ideal. Paul B/Larson.H. Woodin - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
  45.  17
    Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
    Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Lévy collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to ‮א‬₁. Later we give applications, among them the consistency of MM with ‮א‬ω not being Jónsson which answers a question raised in the set theory meeting at (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  46.  24
    Separating club-guessing principles in the presence of fat forcing axioms.David Asperó & Miguel Angel Mota - 2016 - Annals of Pure and Applied Logic 167 (3):284-308.
  47.  26
    Baumgartnerʼs conjecture and bounded forcing axioms.David Asperó, Sy-David Friedman, Miguel Angel Mota & Marcin Sabok - 2013 - Annals of Pure and Applied Logic 164 (12):1178-1186.
  48.  39
    Forcing under Anti‐Foundation Axiom: An expression of the stalks.Sato Kentaro - 2006 - Mathematical Logic Quarterly 52 (3):295-314.
    We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel's AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman's method of defining the extensional membership relation ∈ by means of the intensional membership relation ε .Analogously to the usual (...) and the usual generic extension for FA-models, we can justify the existence of generic filters and can obtain the Forcing Theorem and the Minimal Model Theorem with some modifications. These results are on the line of works to investigate whether model theory for AFA-set theory can be developed in a similar way to that for FA-set theory.Aczel pointed out that the quotient of transition systems by the largest bisimulation and transition relations have the essentially same theory as the set theory with AFA. Therefore, we could hope that, by using our new method, some open problems about transition systems turn out to be consistent or independent. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  49.  34
    W. Hugh Woodin. The axiom of determinacy, forcing axioms, and the nonstationary ideal. De Gruyter series in logic and its applications, no. 1. Walter de Gruyter, Berlin and New York 1999, vi + 934 pp. [REVIEW]Paul B. Larson - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
  50.  71
    Review: W. Hugh Woodin, The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal. [REVIEW]Paul B. Larson - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
1 — 50 / 995