Recursive functions and existentially closed structures

DOI10.1142/S0219061320500026zbMath1484.03126arXiv1710.09864OpenAlexW3101304573WikidataQ127582905 ScholiaQ127582905MaRDI QIDQ5114808

Emil Jeřábek

Publication date: 26 June 2020

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.09864

zbMATH Keywords

classification theoryrelative interpretationrepresentability of recursive functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Classification theory, stability, and related concepts in model theory (03C45) Quantifier elimination, model completeness, and related topics (03C10) Gödel numberings and issues of incompleteness (03F40)

Related Items (5)

A note on uniform density in weak arithmetical theories ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Weak essentially undecidable theories of concatenation ⋮ On interpretability between some weak essentially undecidable theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairs, sets and sequences in first-order theories
• Classification theory and the number of non-isomorphic models
• Simple theories
• On Kim-independence
• Stable theories
• Generic expansion and Skolemization in \(\mathrm{NSOP}_{1}\) theories
• Undecidable theories
• On model-theoretic tree properties
• Undecidable and creative theories
• Cuts, consistency statements and interpretations
• Weak forms of elimination of imaginaries
• Categoricity in Power

This page was built for publication: Recursive functions and existentially closed structures