J. Chen

collaborators

4 papers

math.LO2026

Finite-index extensions of essentially free countable Borel equivalence relations

Jason Zesheng Chen

We show that finite-index extensions of essentially free countable Borel equivalence relations are essentially free, answering a question of Kechris.

math.LO2026

Equivalence of Random Generics Is Not Essentially Free

Jason Zesheng Chen

Let $M$ be a countable transitive model of a sufficiently large finite fragment of ZFC, and let $E_{M}^{B}$ be equivalence of random generics over $M$ . Smythe proved that $…

math.LO2026

Ideals, Well-Orderable Families, and Baire Category in Truss's Feferman-Type Model

Jason Zesheng Chen

Let $BCT_{WO}$ assert that every well-orderable family of dense open subsets of a perfect Polish space has dense intersection, and let $RS_{WO}$ …

cs.AI2026

Recurrent Reasoning on Symbolic Puzzles with Sequence Models

Gowrav Mannem, Chowdhury Marzia Mahjabin, Jason Chen +2

Large language models often appear strong on symbolic and algorithmic tasks, yet this apparent strength can hide brittle behaviour when problems become longer, harder, or slightly…