Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
    We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets; that is, $\mathrm{HOA}=\mathrm{HOD}$. Moreover, we show that every algebraic model of $\mathrm{ZF}$ is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp—an algebraic analogue of the constructible universe—which is obtained by iteratively adding not only (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Recognizable sets and Woodin cardinals: computation beyond the constructible universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Club degrees of rigidity and almost Kurepa trees.Gunter Fuchs - 2013 - Archive for Mathematical Logic 52 (1-2):47-66.
    A highly rigid Souslin tree T is constructed such that forcing with T turns T into a Kurepa tree. Club versions of previously known degrees of rigidity are introduced, as follows: for a rigidity property P, a tree T is said to have property P on clubs if for every club set C (containing 0), the restriction of T to levels in C has property P. The relationships between these rigidity properties for Souslin trees are investigated, and some open questions (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the rigidity of Souslin trees and their generic branches.Hossein Lamei Ramandi - 2022 - Archive for Mathematical Logic 62 (3):419-426.
    We show it is consistent that there is a Souslin tree S such that after forcing with S, S is Kurepa and for all clubs $$C \subset \omega _1$$ C ⊂ ω 1, $$S\upharpoonright C$$ S ↾ C is rigid. This answers the questions in Fuchs (Arch Math Logic 52(1–2):47–66, 2013). Moreover, we show it is consistent with $$\diamondsuit $$ ♢ that for every Souslin tree T there is a dense $$X \subseteq T$$ X ⊆ T which does not contain (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Forcing the Π 3 1 -reduction property and a failure of Π 3 1 -uniformization.Stefan Hoffelner - 2023 - Annals of Pure and Applied Logic 174 (8):103292.
    Download  
     
    Export citation  
     
    Bookmark