Switch to: References

Add citations

You must login to add citations.
  1. Local coherence.Bernhard König - 2003 - Annals of Pure and Applied Logic 124 (1-3):107-139.
    We characterize the tree of functions with finite support in terms of definability. This turns out to have various applications: a new kind of tree dichotomy for ω1 on the one hand. On the other hand, we prove a reflection principle for trees on ω2 under SPFA. This reflection of trees implies stationary reflection.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)P-points In Models.Q. Feng & W. H. Woodin - 2003 - Annals of Pure and Applied Logic 119 (1-3):121-190.
    We show how to get canonical models from in which the nonstationary ideal on ω1 is ω1 dense and there is no P-point.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A microscopic approach to Souslin-tree construction, Part II.Ari Meir Brodsky & Assaf Rinot - 2021 - Annals of Pure and Applied Logic 172 (5):102904.
    In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known ⋄-based constructions of Souslin trees with various additional properties may be rendered as applications of our approach. In this paper, we show that constructions following the same approach may be carried out even in the absence of ⋄. In particular, we obtain a new weak sufficient condition for the existence of Souslin trees at the level of a strongly inaccessible cardinal. We (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Souslin algebra embeddings.Gido Scharfenberger-Fabian - 2011 - Archive for Mathematical Logic 50 (1-2):75-113.
    A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation theory for the complete and atomless subalgebras of Souslin algebras is established (building on ideas of Jech and Jensen). With this we obtain some basic results on the possible types of subalgebras and their interrelation. The second part begins with a review (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Saturation, Suslin trees and meager sets.Paul Larson - 2005 - Archive for Mathematical Logic 44 (5):581-595.
    We show, using a variation of Woodin’s partial order ℙ max , that it is possible to destroy the saturation of the nonstationary ideal on ω 1 by forcing with a Suslin tree. On the other hand, Suslin trees typcially preserve saturation in extensions by ℙ max variations where one does not try to arrange it otherwise. In the last section, we show that it is possible to have a nonmeager set of reals of size ℵ1, saturation of the nonstationary (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • ℙmax variations related to slaloms.Teruyuki Yorioka - 2006 - Mathematical Logic Quarterly 52 (2):203-216.
    We prove the iteration lemmata, which are the key lemmata to show that extensions by Pmax variations satisfy absoluteness for Π2-statements in the structure 〈H , ∈, NSω 1, R 〉 for some set R of reals in L , for the following statements: The cofinality of the null ideal is ℵ1. There exists a good basis of the strong measure zero ideal.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • ℙmax variations for separating club guessing principles.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):532-544.
    In his book on P max [7], Woodin presents a collection of partial orders whose extensions satisfy strong club guessing principles on ω | . In this paper we employ one of the techniques from this book to produce P max variations which separate various club guessing principles. The principle (+) and its variants are weak guessing principles which were first considered by the second author [4] while studying games of length ω | . It was shown in [1] that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A microscopic approach to Souslin-tree constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Terminal notions in set theory.Jindřich Zapletal - 2001 - Annals of Pure and Applied Logic 109 (1-2):89-116.
    In mathematical practice certain formulas φ are believed to essentially decide all other natural properties of the object x. The purpose of this paper is to exactly quantify such a belief for four formulas φ, namely “x is a Ramsey ultrafilter”, “x is a free Souslin tree”, “x is an extendible strong Lusin set” and “x is a good diamond sequence”.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Forcing Axioms and Ω-logic.Teruyuki Yorioka - 2009 - Journal of the Japan Association for Philosophy of Science 36 (2):45-52.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)P-points in Qmax models.Q. Feng & W. H. Woodin - 2003 - Annals of Pure and Applied Logic 119 (1-3):121-190.
    We show how to get canonical models from in which the nonstationary ideal on ω1 is ω1 dense and there is no P-point.
    Download  
     
    Export citation  
     
    Bookmark   1 citation