activity
20242026
most citedThe Borel complexity of the class of models of first-order theories

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

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

Scott Analysis below the Vaught Ordinal

David Gonzalez, Dino Rossegger, Dan Turetsky

We develop new tools for determining the existence of models of specific Scott ranks under countability conditions. Using these, we improve a result of Sacks by showing that any co…