Putnam’s Theorem on the Complexity of Models

DOI10.1007/978-3-319-96274-0_4zbMath1429.03054OpenAlexW2905037992MaRDI QIDQ5214674

Warren D. Goldfarb

Publication date: 5 February 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-96274-0_4

Mathematics Subject Classification ID

Classical first-order logic (03B10) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• On degrees of unsolvability
• A formula with no recursively enumerable model
• Nonrecursive tilings of the plane. I
• Trial and error predicates and the solution to a problem of Mostowski
• ∏ 0 1 Classes and Degrees of Theories
• On a system of axioms which has no recursively enumerable arithmetic model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item