Switch to: References

Citations of:

PFA Implies ADL(R)

Journal of Symbolic Logic 70 (4):1255 - 1296 (2005)

Add citations

You must login to add citations.
  1. Forcing axioms and the uniformization-property.Stefan Hoffelner - 2024 - Annals of Pure and Applied Logic 175 (10):103466.
    Download  
     
    Export citation  
     
    Bookmark  
  • Two Upper Bounds on Consistency Strength of $negsquare{aleph_{omega}}$ and Stationary Set Reflection at Two Successive $aleph{n}$.Martin Zeman - 2017 - Notre Dame Journal of Formal Logic 58 (3):409-432.
    We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We also (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The envelope of a pointclass under a local determinacy hypothesis.Trevor M. Wilson - 2015 - Annals of Pure and Applied Logic 166 (10):991-1018.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Determinacy from strong compactness of ω1.Nam Trang & Trevor M. Wilson - 2021 - Annals of Pure and Applied Logic 172 (6):102944.
    Download  
     
    Export citation  
     
    Bookmark  
  • Determinacy in L.Nam Trang - 2014 - Journal of Mathematical Logic 14 (1):1450006.
    Assume V = L ⊨ ZF + DC + Θ > ω2 + μ is a normal fine measure on.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Combinatorial dichotomies in set theory.Stevo Todorcevic - 2011 - Bulletin of Symbolic Logic 17 (1):1-72.
    We give an overview of a research line concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered on some other perhaps not so large cardinal. While this is of great interest to set theorists, one of the main motivations behind this line of research is in its applicability to other areas of mathematics. We give some details about this and we expose some possible directions for further (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Scales in K at the end of a weak gap.J. R. Steel - 2008 - Journal of Symbolic Logic 73 (2):369-390.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Tame failures of the unique branch hypothesis and models of ADℝ + Θ is regular.Grigor Sargsyan & Nam Trang - 2016 - Journal of Mathematical Logic 16 (2):1650007.
    In this paper, we show that the failure of the unique branch hypothesis for tame iteration trees implies that in some homogenous generic extension of [Formula: see text] there is a transitive model [Formula: see text] containing [Formula: see text] such that [Formula: see text] is regular. The results of this paper significantly extend earlier works from [Non-tame mice from tame failures of the unique branch bypothesis, Canadian J. Math. 66 903–923; Core models with more Woodin cardinals, J. Symbolic Logic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Nontame mouse from the failure of square at a singular strong limit cardinal.Grigor Sargsyan - 2014 - Journal of Mathematical Logic 14 (1):1450003.
    Building on the work of Schimmerling [Coherent sequences and threads, Adv. Math.216 89–117] and Steel [PFA implies AD L, J. Symbolic Logic70 1255–1296], we show that the failure of square principle at a singular strong limit cardinal implies that there is a nontame mouse. The proof presented is the first inductive step beyond L of the core model induction that is aimed at getting a model of ADℝ + "Θ is regular" from the failure of square at a singular strong (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Descriptive inner model theory.Grigor Sargsyan - 2013 - Bulletin of Symbolic Logic 19 (1):1-55.
    The purpose of this paper is to outline some recent progress in descriptive inner model theory, a branch of set theory which studies descriptive set theoretic and inner model theoretic objects using tools from both areas. There are several interlaced problems that lie on the border of these two areas of set theory, but one that has been rather central for almost two decades is the conjecture known as the Mouse Set Conjecture. One particular motivation for resolving MSC is that (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • More on regular and decomposable ultrafilters in ZFC.Paolo Lipparini - 2010 - Mathematical Logic Quarterly 56 (4):340-374.
    We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters; among them: If m ≥ 1 and the ultrafilter D is , equation imagem)-regular, then D is κ -decomposable for some κ with λ ≤ κ ≤ 2λ ). If λ is a strong limit cardinal and D is , equation imagem)-regular, then either D is -regular or there are arbitrarily large κ < λ for which D is κ -decomposable ). Suppose that λ is singular, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Closure properties of measurable ultrapowers.Philipp Lücke & Sandra Müller - 2021 - Journal of Symbolic Logic 86 (2):762-784.
    We study closure properties of measurable ultrapowers with respect to Hamkin's notion of freshness and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one direction, a result of Sakai shows that, by collapsing a strongly compact cardinal to become the double successor of a measurable cardinal, it is possible to obtain a model of set theory in which such ultrapowers possess the strongest possible closure properties. In the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Characterizing all models in infinite cardinalities.Lauri Keskinen - 2013 - Annals of Pure and Applied Logic 164 (3):230-250.
    Fix a cardinal κ. We can ask the question: what kind of a logic L is needed to characterize all models of cardinality κ up to isomorphism by their L-theories? In other words: for which logics L it is true that if any models A and B of cardinality κ satisfy the same L-theory then they are isomorphic?It is always possible to characterize models of cardinality κ by their Lκ+,κ+-theories, but we are interested in finding a “small” logic L, i.e., (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Maximality Principles in Set Theory.Luca Incurvati - 2017 - Philosophia Mathematica 25 (2):159-193.
    In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Proper and piecewise proper families of reals.Victoria Gitman - 2009 - Mathematical Logic Quarterly 55 (5):542-550.
    I introduced the notions of proper and piecewise proper families of reals to make progress on a long standing open question in the field of models of Peano Arithmetic [5]. A family of reals is proper if it is arithmetically closed and its quotient Boolean algebra modulo the ideal of finite sets is a proper poset. A family of reals is piecewise proper if it is the union of a chain of proper families each of whom has size ≤ ω1.Here, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Definable MAD families and forcing axioms.Vera Fischer, David Schrittesser & Thilo Weinert - 2021 - Annals of Pure and Applied Logic 172 (5):102909.
    Download  
     
    Export citation  
     
    Bookmark  
  • Rado's Conjecture implies that all stationary set preserving forcings are semiproper.Philipp Doebler - 2013 - Journal of Mathematical Logic 13 (1):1350001.
    Todorčević showed that Rado's Conjecture implies CC*, a strengthening of Chang's Conjecture. We generalize this by showing that also CC**, a global version of CC*, follows from RC. As a corollary we obtain that RC implies Semistationary Reflection and, i.e. the statement that all forcings that preserve the stationarity of subsets of ω1 are semiproper.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The strength of choiceless patterns of singular and weakly compact cardinals.Daniel Busche & Ralf Schindler - 2009 - Annals of Pure and Applied Logic 159 (1-2):198-248.
    We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that , the Axiom of Determinacy, holds in the of a generic extension of : every uncountable cardinal is singular, and every infinite successor cardinal is weakly compact and every uncountable limit cardinal is singular.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Structural Relativity and Informal Rigour.Neil Barton - 2022 - In Gianluigi Oliveri, Claudio Ternullo & Stefano Boscolo (eds.), Objects, Structures, and Logics, FilMat Studies in the Philosophy of Mathematics. Springer. pp. 133-174.
    Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...)
    Download  
     
    Export citation  
     
    Bookmark