REVIEW
The Borel complexity of the class of models of first-order theories
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Borel complexity of the class of models of first-order theories
abstract
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In particular, any sequential theory (a class of foundational theories isolated by Pudl\'ak) has a $\pmb\Pi_\omega^0$-complete set of models. We also give sharp conditions for theories to have a $\pmb\Pi^0_n$-complete set of models.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.