2 papers
math.LO2026
Infinite Belligerent Jump Inversion and Computable Scott Analysis
Uri Andrews, David Gonzalez, Hongyu Zhu
Scott analysis provides two fundamental tools for studying countable structures: Scott sentences, which characterize structures up to isomorphism, and back-and-forth relations, whi…
math.LO2026
A Complete Bounded Theory with Unbounded Types
Hongyu Zhu
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an…