Results for 'Prewellordering'

11 found
Order:
  1.  14
    Projective prewellorderings vs projective wellfounded relations.Xianghui Shi - 2009 - Journal of Symbolic Logic 74 (2):579-596.
    We show that it is relatively consistent with ZFC that there is a projective wellfounded relation with rank higher than all projective prewellorderings.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  2.  14
    On the prewellorderings associated with the directed systems of mice.Grigor Sargsyan - 2013 - Journal of Symbolic Logic 78 (3):735-763.
  3.  9
    A Problem Concerning Projective Prewellorderings.Douglas R. Busch - 1976 - Mathematical Logic Quarterly 23 (13‐15):237-240.
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  23
    A Problem Concerning Projective Prewellorderings.Douglas R. Busch - 1977 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 23 (13-15):237-240.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  5
    Iterating the Superjump Along Definable Prewellorderings.Galen Weitkamp - 1982 - Mathematical Logic Quarterly 28 (27‐32):385-394.
  6.  20
    Iterating the Superjump Along Definable Prewellorderings.Galen Weitkamp - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):385-394.
  7.  18
    The order of reflection.Juan P. Aguilera - 2021 - Journal of Symbolic Logic 86 (4):1555-1583.
    Extending Aanderaa’s classical result that $\pi ^{1}_{1} < \sigma ^{1}_{1}$, we determine the order between any two patterns of iterated $\Sigma ^{1}_{1}$ - and $\Pi ^{1}_{1}$ -reflection on ordinals. We show that this order of linear reflection is a prewellordering of length $\omega ^{\omega }$. This requires considering the relationship between linear and some non-linear reflection patterns, such as $\sigma \wedge \pi $, the pattern of simultaneous $\Sigma ^{1}_{1}$ - and $\Pi ^{1}_{1}$ -reflection. The proofs involve linking the lengths (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  9
    Divergent Models with the Failure of the Continuum Hypothesis.Nam Trang - forthcoming - Journal of Symbolic Logic:1-11.
    We construct divergent models of $\mathsf {AD}^+$ along with the failure of the Continuum Hypothesis ( $\mathsf {CH}$ ) under various assumptions. Divergent models of $\mathsf {AD}^+$ play an important role in descriptive inner model theory; all known analyses of HOD in $\mathsf {AD}^+$ models (without extra iterability assumptions) are carried out in the region below the existence of divergent models of $\mathsf {AD}^+$. Our results are the first step toward resolving various open questions concerning the length of definable prewellorderings (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  9
    Countable Length Everywhere Club Uniformization.William Chan, Stephen Jackson & Nam Trang - 2023 - Journal of Symbolic Logic 88 (4):1556-1572.
    Assume $\mathsf {ZF} + \mathsf {AD}$ and all sets of reals are Suslin. Let $\Gamma $ be a pointclass closed under $\wedge $, $\vee $, $\forall ^{\mathbb {R}}$, continuous substitution, and has the scale property. Let $\kappa = \delta (\Gamma )$ be the supremum of the length of prewellorderings on $\mathbb {R}$ which belong to $\Delta = \Gamma \cap \check \Gamma $. Let $\mathsf {club}$ denote the collection of club subsets of $\kappa $. Then the countable length everywhere club uniformization (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  61
    Some applications of coarse inner model theory.Greg Hjorth - 1997 - Journal of Symbolic Logic 62 (2):337-365.
    The Martin-Steel coarse inner model theory is employed in obtaining new results in descriptive set theory. $\underset{\sim}{\Pi}$ determinacy implies that for every thin Σ 1 2 equivalence relation there is a Δ 1 3 real, N, over which every equivalence class is generic--and hence there is a good Δ 1 2 (N ♯ ) wellordering of the equivalence classes. Analogous results are obtained for Π 1 2 and Δ 1 2 quasilinear orderings and $\underset{\sim}{\Pi}^1_2$ determinacy is shown to imply that (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  13
    Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.
    Under the assumption that there exists an elementary embedding (henceforth abbreviated as and in particular under we prove a Coding Lemma for and find certain versions of it which are equivalent to strong regularity of cardinals below . We also prove that a stronger version of the Coding Lemma holds for a stationary set of ordinals below.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations