Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Fine Structure and Class Forcing.M. C. Stanley - 2001 - Bulletin of Symbolic Logic 7 (4):522-525.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (2 other versions)Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • (1 other version)Trees and -subsets of ω1ω1.Alan Mekler & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Global singularization and the failure of SCH.Radek Honzik - 2010 - Annals of Pure and Applied Logic 161 (7):895-915.
    We say that κ is μ-hypermeasurable for a cardinal μ≥κ+ if there is an embedding j:V→M with critical point κ such that HV is included in M and j>μ. Such a j is called a witnessing embedding.Building on the results in [7], we will show that if V satisfies GCH and F is an Easton function from the regular cardinals into cardinals satisfying some mild restrictions, then there exists a cardinal-preserving forcing extension V* where F is realised on all V-regular (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • -Definability at uncountable regular cardinals.Philipp Lücke - 2012 - Journal of Symbolic Logic 77 (3):1011-1046.
    Let k be an infinite cardinal. A subset of $(^k k)^n $ is a $\Sigma _1^1 $ -subset if it is the projection p[T] of all cofinal branches through a subtree T of $(lt;kk)^{n + 1} $ of height k. We define $\Sigma _k^1 - ,\Pi _k^1 $ - and $\Delta _k^1$ subsets of $(^k k)^n $ as usual. Given an uncountable regular cardinal k with k = k (...))
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Large cardinals and locally defined well-orders of the universe.David Asperó & Sy-David Friedman - 2009 - Annals of Pure and Applied Logic 157 (1):1-15.
    By forcing over a model of with a class-sized partial order preserving this theory we produce a model in which there is a locally defined well-order of the universe; that is, one whose restriction to all levels H is a well-order of H definable over the structure H, by a parameter-free formula. Further, this forcing construction preserves all supercompact cardinals as well as all instances of regular local supercompactness. It is also possible to define variants of this construction which, in (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 105--138.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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 can be order-preservingly mapped (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Definable well-orders of $H(\omega _2)$ and $GCH$.David Asperó & Sy-David Friedman - 2012 - Journal of Symbolic Logic 77 (4):1101-1121.
    Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   5 citations