•  8
    More definable combinatorics around the first and second uncountable cardinals
    with Stephen Jackson and Nam Trang
    Journal of Mathematical Logic 23 (3). 2023.
    Assume [Formula: see text]. If [Formula: see text] is an ordinal and X is a set of ordinals, then [Formula: see text] is the collection of order-preserving functions [Formula: see text] which have uniform cofinality [Formula: see text] and discontinuous everywhere. The weak partition properties on [Formula: see text] and [Formula: see text] yield partition measures on [Formula: see text] when [Formula: see text] and [Formula: see text] when [Formula: see text]. The following almost everywhere co…Read more
  •  10
    Countable Length Everywhere Club Uniformization
    with Stephen Jackson and Nam Trang
    Journal of Symbolic Logic 88 (4): 1556-1572. 2023.
    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 hol…Read more
  •  13
  •  21
    Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations
    with Stephen Jackson
    Annals of Pure and Applied Logic 172 (8): 102988. 2021.
  •  8
    Bounds on Scott ranks of some polish metric spaces
    Journal of Mathematical Logic 21 (1): 2150001. 2020.
    If [Formula: see text] is a proper Polish metric space and [Formula: see text] is any countable dense submetric space of [Formula: see text], then the Scott rank of [Formula: see text] in the natural first-order language of metric spaces is countable and in fact at most [Formula: see text], where [Formula: see text] is the Church–Kleene ordinal of [Formula: see text] which is the least ordinal with no presentation on [Formula: see text] computable from [Formula: see text]. If [Formula: see text]…Read more