On the arithmetical complexity of models

DOI10.1017/BSL.2025.10125MaRDI QIDQ7288001zbMATH OpenFDO

Authors Warren D. Goldfarb

Publication date 26 June 2026

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/BSL.2025.10125

Mathematics Subject Classification ID

Classical first-order logic (03B10) Other classical first-order model theory (03C68) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• Classical recursion theory. The theory of functions and sets of natural numbers
• Grundlagen der Mathematik. Bd. II.
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3085186 (Why is no real title available?)
• Model theory
• Normal models and the field $Σ*_1$
• On a system of axioms which has no recursively enumerable arithmetic model
• On degrees of unsolvability
• Putnam's theorem on the complexity of models
• The interpretation existence lemma
• Trial and error predicates and the solution to a problem of Mostowski

This page was built for publication: On the arithmetical complexity of models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288001)