22 found
Order:
Disambiguations
Stevo Todorčević [25]Stevo B. Todorčević [1]
  1.  21
    Cofinal Types of Ultrafilters.Dilip Raghavan & Stevo Todorcevic - 2012 - Annals of Pure and Applied Logic 163 (3):185-199.
  2.  16
    Conjectures of Rado and Chang and Special Aronszajn Trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4):342-347.
    We show that both Rado's Conjecture and strong Chang's Conjecture imply that there are no special ℵ2-Aronszajn trees if the Continuum Hypothesis fails. We give similar result for trees of higher heights and we also investigate the influence of Rado's Conjecture on square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  3.  15
    Conjectures of Rado and Chang and Special Aronszajn Trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4-5):342-347.
    We show that both Rado's Conjecture and strong Chang's Conjecture imply that there are no special ℵ2-Aronszajn trees if the Continuum Hypothesis fails. We give similar result for trees of higher heights and we also investigate the influence of Rado's Conjecture on square sequences.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  4.  9
    Forcing by Non-Scattered Sets.Miloš S. Kurilić & Stevo Todorčević - 2012 - Annals of Pure and Applied Logic 163 (9):1299-1308.
  5.  24
    Baumgartner’s Isomorphism Problem for $$\Aleph _2$$ ℵ 2 -Dense Suborders of $$\Mathbb {R}$$ R.Justin Tatch Moore & Stevo Todorcevic - 2017 - Archive for Mathematical Logic 56 (7-8):1105-1114.
    In this paper we will analyze Baumgartner’s problem asking whether it is consistent that \ and every pair of \-dense subsets of \ are isomorphic as linear orders. The main result is the isolation of a combinatorial principle \\) which is immune to c.c.c. forcing and which in the presence of \ implies that two \-dense sets of reals can be forced to be isomorphic via a c.c.c. poset. Also, it will be shown that it is relatively consistent with ZFC (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  38
    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 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  9
    Collapsing $$Omega _2$$ with Semi-Proper Forcing.Stevo Todorcevic - 2018 - Archive for Mathematical Logic 57 (1-2):185-194.
    We examine the differences between three standard classes of forcing notions relative to the way they collapse the continuum. It turns out that proper and semi-proper posets behave differently in that respect from the class of posets that preserve stationary subsets of \.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  9
    The Poset of All Copies of the Random Graph has the 2-Localization Property.Miloš S. Kurilić & Stevo Todorčević - 2016 - Annals of Pure and Applied Logic 167 (8):649-662.
  9.  13
    James E. Baumgartner. Bases for Aronszajn Trees. Tsukuba Journal of Mathematics, Vol. 9 , Pp. 31–40. - James E. Baumgartner. Polarized Partition Relations and Almost-Disjoint Functions. Logic, Methodology and Philosophy of Science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, Edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in Logic and the Foundations of Mathematics, Vol. 126, North-Holland, Amsterdam Etc. 1989, Pp. 213–222. [REVIEW]Stevo Todorcevic - 2000 - Bulletin of Symbolic Logic 6 (4):497-498.
  10.  17
    Trees and Ehrenfeucht–Fraı̈ssé Games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
    Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  11.  6
    Rado's Conjecture and Ascent Paths of Square Sequences.Stevo Todorčević & Víctor Torres Pérez - 2014 - Mathematical Logic Quarterly 60 (1-2):84-90.
  12.  13
    Prime Ideals on P Ω (Λ) with the Partition Property.Pierre Matet, Cédric Péan & Stevo Todorcevic - 2002 - Archive for Mathematical Logic 41 (8):743-764.
  13.  13
    Review: James E. Baumgartner, Bases for Aronszajn Trees; James E. Baumgartner, Polarized Partition Relations and Almost-Disjoint Functions. [REVIEW]Stevo Todorcevic - 2000 - Bulletin of Symbolic Logic 6 (4):497-498.
  14.  20
    A Hierarchy of Tree-Automatic Structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
    We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  15.  10
    Moscone Center West, San Francisco, CA January 15–16, 2010.Fernando J. Ferreira, John Harrison, François Loeser, Chris Miller, Joseph S. Miller, Slawomir J. Solecki, Stevo Todorcevic & John Steel - 2010 - Bulletin of Symbolic Logic 16 (3).
    Direct download  
     
    Export citation  
     
    Bookmark  
  16.  17
    Real Functions on the Family of All Well-Ordered Subsets of a Partially Ordered Set.Stevo Todorčević - 1983 - Journal of Symbolic Logic 48 (1):91-96.
  17.  11
    Local Sentences and Mahlo Cardinals.Olivier Finkel & Stevo Todorcevic - 2007 - Mathematical Logic Quarterly 53 (6):558-563.
    Local sentences were introduced by Ressayre in [6] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for these sentences and the existence of some infinite well ordered models. Two of these stretching theorems were only proved under certain large cardinal axioms but the question of their exact strength was left open in [4]. Here we solve this problem, using a combinatorial result of J. H. Schmerl [7]. In fact, we show that the stretching (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18. 2003 European Summer Meeting of the Association for Symbolic Logic Logic Colloquim'03.Michael Benedikt, Stevo Todorcevic, Alexandru Baltag, Howard Becker, Matthew Foreman, Jean-Yves Girard, Martin Grohe, Peter T. Johnstone, Simo Knuuttila & Menachem Kojman - 2004 - Bulletin of Symbolic Logic 10 (2).
  19. University of Nevada, Las Vegas, Las Vegas, Nevada June 1–4, 2002.Scot Adams, Shaughan Lavine, Zlil Sela, Natarajan Shankar, Stephen Simpson, Stevo Todorcevic & Theodore A. Slaman - 2003 - Bulletin of Symbolic Logic 9 (1).
     
    Export citation  
     
    Bookmark  
  20.  7
    Property {(Hbar)} and Cellularity of Complete Boolean Algebras.Miloš S. Kurilić & Stevo Todorčević - 2009 - Archive for Mathematical Logic 48 (8):705-718.
    A complete Boolean algebra ${\mathbb{B}}$ satisfies property ${(\hbar)}$ iff each sequence x in ${\mathbb{B}}$ has a subsequence y such that the equality lim sup z n = lim sup y n holds for each subsequence z of y. This property, providing an explicit definition of the a posteriori convergence in complete Boolean algebras with the sequential topology and a characterization of sequential compactness of such spaces, is closely related to the cellularity of Boolean algebras. Here we determine the position of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21. REVIEWS-Two Papers.James Baumgartner & Stevo Todorcevic - 2000 - Bulletin of Symbolic Logic 6 (4):497-497.
  22.  10
    Trees, Subtrees and Order Types.Stevo B. Todorčević - 1981 - Annals of Pure and Applied Logic 20 (3):233.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations