Results for 'Souslin trees'

995 found
Order:
  1.  42
    μ-complete Souslin trees on μ+.Menachem Kojman & Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (3):195-201.
    We prove thatµ=µ <µ , 2 µ =µ + and “there is a non-reflecting stationary subset ofµ + composed of ordinals of cofinality <μ” imply that there is a μ-complete Souslin tree onµ +.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  57
    Higher Souslin trees and the generalized continuum hypothesis.John Gregory - 1976 - Journal of Symbolic Logic 41 (3):663-671.
  3.  21
    Souslin trees and successors of singular cardinals.Shai Ben-David & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 30 (3):207-217.
  4.  7
    Souslin trees at successors of regular cardinals.Assaf Rinot - 2019 - Mathematical Logic Quarterly 65 (2):200-204.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  61
    Degrees of rigidity for Souslin trees.Gunter Fuchs & Joel David Hamkins - 2009 - Journal of Symbolic Logic 74 (2):423-454.
    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 forcing.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  6.  9
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  46
    An variation for one souslin tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
    We present a variation of the forcing S max as presented in Woodin [4]. Our forcing is a P max -style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T G which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T G (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8.  25
    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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  3
    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 (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  16
    Gregory John. Higher Souslin trees and the generalized continuum hypothesis.Daniel Velleman - 1984 - Journal of Symbolic Logic 49 (2):663-665.
  11.  18
    More Notions of Forcing Add a Souslin Tree.Ari Meir Brodsky & Assaf Rinot - 2019 - Notre Dame Journal of Formal Logic 60 (3):437-455.
    An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, Magidor, and Radin forcing.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  26
    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.
    We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  20
    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  
  14.  28
    An $mathbb{S}_{max}$ Variation for One Souslin Tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
    We present a variation of the forcing $\mathbb{S}_{max}$ as presented in Woodin [4]. Our forcing is a $\mathbb{P}_{max}$-style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T$_G$ which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T$_G$ being this minimal tree. In (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  14
    Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
    We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  35
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  37
    Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
    We define the notion of Souslin forcing, and we prove that some properties are preserved under iteration. We define a weaker form of Martin's axiom, namely MA(Γ + ℵ 0 ), and using the results on Souslin forcing we show that MA(Γ + ℵ 0 ) is consistent with the existence of a Souslin tree and with the splitting number s = ℵ 1 . We prove that MA(Γ + ℵ 0 ) proves the additivity of measure. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  18.  22
    Chain homogeneous Souslin algebras.Gido Scharfenberger-Fabian - 2011 - Mathematical Logic Quarterly 57 (6):591-610.
    Assuming Jensen's principle ◊+ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todorčević.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  23
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  33
    Aronszajn trees, square principles, and stationary reflection.Chris Lambie-Hanson - 2017 - Mathematical Logic Quarterly 63 (3-4):265-281.
    We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of introduced by Brodsky and Rinot for the purpose of constructing κ‐Souslin trees. Answering a question of Rinot, we prove that the weaker of these strengthenings is compatible with stationary reflection at κ but the stronger is not. We then prove that, if μ is a singular cardinal, implies the existence of a special ‐tree with a cf(μ)‐ascent path, thus answering a (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  21.  55
    Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
    We study descriptive set theory in the space ω1 ω 1 by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of Π 1 1 -sets of ω1 ω 1 . We call a family U of trees universal for a class V of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in V (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  22.  21
    Trees and $Pi^11$-Subsets of $^{omega_1}omega1$.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
    We study descriptive set theory in the space $^{\omega_1}\omega_1$ by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of $\Pi^1_1$-sets of $^{\omega_1}\omega_1$. We call a family $\mathscr{U}$ of trees universal for a class $\mathscr{V}$ of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in $\mathscr{V}$ can be order-preservingly mapped into a tree in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  26
    Pronouncing “the” as “thee” to signal problems in speaking.Jean E. Fox Tree & Herbert H. Clark - 1997 - Cognition 62 (2):151-167.
  24.  8
    Discourse markers in writing.Jean E. Fox Tree - 2015 - Discourse Studies 17 (1):64-82.
    Words like well, oh, and you know have long been observed and studied in spontaneous speech. With the proliferation of on-line dialogues, such as instant messaging between friends or back-and-forth postings at websites, there are increasing opportunities to observe them in spontaneous writing. In Experiment 1, the interpretation of discourse markers in on-line debates was compared to proposed functions of those markers identified in other settings. In Experiment 2, the use of discourse markers in spontaneous speech was compared to their (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  6
    Placing like in telling stories.Jean E. Fox Tree - 2006 - Discourse Studies 8 (6):723-743.
    The discourse marker use of the word like is considered by many to be superfluously sprinkled into talk, a bad habit best avoided. But a comparison of the use of like in successive tellings of stories demonstrates that like can be anticipated in advance and planned into stories. In this way, like is similar to other words and phrases tellers recycle during story telling. The anticipation of like contrasted with the uses of other discourse markers such as oh, you know, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  43
    Using uh and um in spontaneous speaking.Herbert H. Clark & Jean E. Fox Tree - 2002 - Cognition 84 (1):73-111.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   40 citations  
  27.  52
    Experiential learning of empathy in a care-ethics lab.Linus Vanlaere, Trees Coucke & Chris Gastmans - 2010 - Nursing Ethics 17 (3):325-336.
    To generate empathy in the care of vulnerable older persons requires care providers to reflect critically on their care practices. Ethics education and training must provide them with tools to accomplish such critical reflection. It must also create a pedagogical context in which good care can be taught and cultivated. The care-ethics lab ‘sTimul’ originated in 2008 in Flanders with the stimulation of ethical reflection in care providers and care providers in training as its main goal. Also in 2008, sTimul (...)
    Direct download  
     
    Export citation  
     
    Bookmark   24 citations  
  28.  7
    Recognizing Verbal Irony in Spontaneous Speech.Gregory A. Bryant & Jean E. Fox Tree - 2002 - Metaphor and Symbol 17 (2):99-119.
    We explored the differential impact of auditory information and written contextual information on the recognition of verbal irony in spontaneous speech. Based on relevance theory, we predicted that speakers would provide acoustic disambiguation cues when speaking in situations that lack other sources of information, such as a visual channel. We further predicted that listeners would use this information, in addition to context, when interpreting the utterances. People were presented with spontaneously produced ironic and nonironic utterances from radio talk shows in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  29.  21
    Overhearers Use Addressee Backchannels in Dialog Comprehension.Jackson Tolins & Jean E. Fox Tree - 2016 - Cognitive Science 40 (6):1412-1434.
    Observing others in conversation is a common format for comprehending language, yet little work has been done to understand dialog comprehension. We tested whether overhearers use addressee backchannels as predictive cues for how to integrate information across speaker turns during comprehension of spontaneously produced collaborative narration. In Experiment 1, words that followed specific backchannels were recognized more slowly than words that followed either generic backchannels or pauses. In Experiment 2, we found that when the turn after the backchannel was a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  28
    Computational modeling of reading in semantic dementia: Comment on Woollams, Lambon Ralph, Plaut, and Patterson (2007).Max Coltheart, Jeremy J. Tree & Steven J. Saunders - 2010 - Psychological Review 117 (1):256-271.
  31.  17
    Listeners’ comprehension of uptalk in spontaneous speech.John M. Tomlinson & Jean E. Fox Tree - 2011 - Cognition 119 (1):58-69.
  32. Recognition memory in developmental prosopagnosia: electrophysiological evidence for abnormal routes to face recognition.Edwin J. Burns, Jeremy J. Tree & Christoph T. Weidemann - 2014 - Frontiers in Human Neuroscience 8.
  33.  16
    The Chinese supervisor's perspective of receiving unsolicited subordinate helping behaviour: a theoretical analysis.Shih Yung Chou & Tree Chang - 2017 - International Journal of Management Concepts and Philosophy 10 (4):445.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  17
    Postscript: Reading in semantic dementia—A response to Woollams, Lambon Ralph, Plaut, and Patterson (2010).Max Coltheart, Jeremy J. Tree & Steven J. Saunders - 2010 - Psychological Review 117 (1):271-272.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  35.  3
    Editorial: Improving Wellbeing in Patients With Chronic Conditions: Theory, Evidence, and Opportunities.Andrew H. Kemp, Jeremy Tree, Fergus Gracey & Zoe Fisher - 2022 - Frontiers in Psychology 13.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  20
    Protectors of Wellbeing During the COVID-19 Pandemic: Key Roles for Gratitude and Tragic Optimism in a UK-Based Cohort.Jessica P. Mead, Zoe Fisher, Jeremy J. Tree, Paul T. P. Wong & Andrew H. Kemp - 2021 - Frontiers in Psychology 12.
    The COVID-19 pandemic has presented a global threat to physical and mental health worldwide. Research has highlighted adverse impacts of COVID-19 on wellbeing but has yet to offer insights as to how wellbeing may be protected. Inspired by developments in wellbeing science and guided by our own theoretical framework, we examined the role of various potentially protective factors in a sample of 138 participants from the United Kingdom. Protective factors included physical activity, tragic optimism, gratitude, social support, and nature connectedness. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  37.  33
    Appropriate computer-mediated communication: An Australian indigenous information system case study. [REVIEW]Andrew Turk & Kathryn Trees - 1999 - AI and Society 13 (4):377-388.
    This article discusses ways to operationalise the concept of culturally appropriate computer-mediated communication, utilising information systems (IS) development methodologies and adopting a postmodern and postcolonial perspective. By way of illustration, it describes progress on the participative development of the Ieramugadu Cultural Information System. This project is designed to develop and evaluate innovative procedures for elicitation, analysis, storage and communication of indigenous cultural heritage information. It is investigating culturally appropriate IS design techniques, multimedia approaches and ways to ensure protection of secret/sacred (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  10
    The domain-specificity of face matching impairments in 40 cases of developmental prosopagnosia.Sarah Bate, Rachel J. Bennetts, Jeremy J. Tree, Amanda Adams & Ebony Murray - 2019 - Cognition 192:104031.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  9
    Care‐givers’ reflections on an ethics education immersive simulation care experience: A series of epiphanous events.Ann Gallagher, Matthew Peacock, Magdalena Zasada, Trees Coucke, Anna Cox & Nele Janssens - 2017 - Nursing Inquiry 24 (3):e12174.
    There has been little previous scholarship regarding the aims, options and impact of ethics education on residential care‐givers. This manuscript details findings from a pragmatic cluster trial evaluating the impact of three different approaches to ethics education. The focus of the article is on one of the interventions, an immersive simulation experience. The simulation experience required residential care‐givers to assume the profile of elderly care‐recipients for a 24‐hr period. The care‐givers were student nurses. The project was reviewed favourably by a (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Angrilli, A., B1.S. Atran, J. N. Bailenson, I. Boutet, A. Chaudhuri, H. H. Clark, J. D. Coley & J. E. Fox Tree - 2002 - Cognition 84:363.
     
    Export citation  
     
    Bookmark   1 citation  
  41.  8
    Can Machines Find the Bilingual Advantage? Machine Learning Algorithms Find No Evidence to Differentiate Between Lifelong Bilingual and Monolingual Cognitive Profiles.Samuel Kyle Jones, Jodie Davies-Thompson & Jeremy Tree - 2021 - Frontiers in Human Neuroscience 15.
    Bilingualism has been identified as a potential cognitive factor linked to delayed onset of dementia as well as boosting executive functions in healthy individuals. However, more recently, this claim has been called into question following several failed replications. It remains unclear whether these contradictory findings reflect how bilingualism is defined between studies, or methodological limitations when measuring the bilingual effect. One key issue is that despite the claims that bilingualism yields general protection to cognitive processes, studies reporting putative bilingual differences (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  44
    The man who mistook his neuropsychologist for a popstar: when configural processing fails in acquired prosopagnosia.Ashok Jansari, Scott Miller, Laura Pearce, Stephanie Cobb, Noam Sagiv, Adrian L. Williams, Jeremy J. Tree & J. Richard Hanley - 2015 - Frontiers in Human Neuroscience 9.
  43.  13
    Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.
    We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that ${\diamondsuit(2^\omega, [\omega]^\omega}$ , is almost constant on) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. This implies the analogous result for a double weakening of the club principle.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  19
    The eightfold way.James Cummings, Sy-David Friedman, Menachem Magidor, Assaf Rinot & Dima Sinapova - 2018 - Journal of Symbolic Logic 83 (1):349-371.
    Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at${\kappa ^{ + + }}$, assuming that$\kappa = {\kappa ^{ < \kappa }}$and there is a weakly compact cardinal aboveκ.If in additionκis supercompact then we can forceκto be${\aleph _\omega }$in the extension. The proofs combine the techniques of adding and then destroying (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  45.  47
    Adding Closed Unbounded Subsets of ω₂ with Finite Forcing.William J. Mitchell - 2005 - Notre Dame Journal of Formal Logic 46 (3):357-371.
    An outline is given of the proof that the consistency of a κ⁺-Mahlo cardinal implies that of the statement that I[ω₂] does not include any stationary subsets of Cof(ω₁). An additional discussion of the techniques of this proof includes their use to obtain a model with no ω₂-Aronszajn tree and to add an ω₂-Souslin tree with finite conditions.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  46.  22
    Canonical models for ℵ1-combinatorics.Saharon Shelah & Jindr̆ich Zapletal - 1999 - Annals of Pure and Applied Logic 98 (1-3):217-259.
    We define the property of Π2-compactness of a statement Φ of set theory, meaning roughly that the hard core of the impact of Φ on combinatorics of 1 can be isolated in a canonical model for the statement Φ. We show that the following statements are Π2-compact: “dominating NUMBER = 1,” “cofinality of the meager IDEAL = 1”, “cofinality of the null IDEAL = 1”, “bounding NUMBER = 1”, existence of various types of Souslin trees and variations on (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  47.  71
    Sets constructible from sequences of ultrafilters.William J. Mitchell - 1974 - Journal of Symbolic Logic 39 (1):57-66.
    In [4], Kunen used iterated ultrapowers to show that ifUis a normalκ-complete nontrivial ultrafilter on a cardinalκthenL[U], the class of sets constructive fromU, has only the ultrafilterU∩L[U] and this ultrafilter depends only onκ. In this paper we extend Kunen's methods to arbitrary sequencesUof ultrafilters and obtain generalizations of these results. In particular we answer Problem 1 of Kunen and Paris [5] which asks whether the number of ultrafilters onκcan be intermediate between 1 and 22κ. If there is a normalκ-complete ultrafilterUonκsuch (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  48.  21
    Closed maximality principles: implications, separations and combinations.Gunter Fuchs - 2008 - Journal of Symbolic Logic 73 (1):276-308.
    l investigate versions of the Maximality Principles for the classes of forcings which are <κ-closed. <κ-directed-closed, or of the form Col (κ. <Λ). These principles come in many variants, depending on the parameters which are allowed. I shall write MPΓ(A) for the maximality principle for forcings in Γ, with parameters from A. The main results of this paper are: • The principles have many consequences, such as <κ-closed-generic $\Sigma _{2}^{1}(H_{\kappa})$ absoluteness, and imply. e.g., that ◇κ holds. I give an application (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  49.  11
    On guessing generalized clubs at the successors of regulars.Assaf Rinot - 2011 - Annals of Pure and Applied Logic 162 (7):566-577.
    König, Larson and Yoshinobu initiated the study of principles for guessing generalized clubs, and introduced a construction of a higher Souslin tree from the strong guessing principle.Complementary to the author’s work on the validity of diamond and non-saturation at the successor of singulars, we deal here with a successor of regulars. It is established that even the non-strong guessing principle entails non-saturation, and that, assuming the necessary cardinal arithmetic configuration, entails a diamond-type principle which suffices for the construction of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  15
    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”.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 995