Degrees of rigidity for Souslin trees
Journal of Symbolic Logic 74 (2):423-454 (2009)
Abstract
We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcingAuthor's Profile
DOI
10.2178/jsl/1243948321
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L.Gunter Fuchs & Joel David Hamkins - 2008 - Journal of Symbolic Logic 73 (2):614 - 633.
Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
On the Hanf number of souslin logic.John P. Burgess - 1978 - Journal of Symbolic Logic 43 (3):568-571.
Kinds, general terms, and rigidity: A reply to LaPorte.Stephen P. Schwartz - 2002 - Philosophical Studies 109 (3):265 - 277.
Forcing with Δ perfect trees and minimal Δ-degrees.Alexander S. Kechris - 1981 - Journal of Symbolic Logic 46 (4):803 - 816.
Rigidity, natural kind terms and metasemantics.Corine Besson - 2010 - In Helen Beebee & Nigel Sabbarton-Leary (eds.), The Semantics and Metaphysics of Natural Kinds. Routledge. pp. 25--44.
On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
Rigidity and the description of counterfactual situations.Genoveva Martí - 1998 - Theoria 13 (3):477-490.
Analytics
Added to PP
2010-09-12
Downloads
43 (#274,305)
6 months
1 (#455,921)
2010-09-12
Downloads
43 (#274,305)
6 months
1 (#455,921)
Historical graph of downloads
Author's Profile
Citations of this work
Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
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.
Club degrees of rigidity and almost Kurepa trees.Gunter Fuchs - 2013 - Archive for Mathematical Logic 52 (1-2):47-66.
Souslin algebra embeddings.Gido Scharfenberger-Fabian - 2011 - Archive for Mathematical Logic 50 (1-2):75-113.
On the rigidity of Souslin trees and their generic branches.Hossein Lamei Ramandi - forthcoming - Archive for Mathematical Logic:1-8.
References found in this work
Changing the heights of automorphism towers.Joel David Hamkins & Simon Thomas - 2000 - Annals of Pure and Applied Logic 102 (1-2):139-157.
