Model completeness and relative decidability

DOI10.1007/S00153-020-00753-4MaRDI QIDQ2042736OpenAlexWikidataFDO

Authors Jennifer Chubb, Russell Miller, Reed Solomon

Publication date 21 July 2021

Published in Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

model theorycomputabilitymodel completenesscomputable model theoryrelative decidability

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• Trivial, strongly minimal theories are model complete after naming constants
• Computable trees, prime models, and relative decidability
• Publication:3028991
• Effective prime uniqueness
• scientific article; zbMATH DE number 1302870

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• A computable functor from graphs to fields
• Computability theoretic classifications for classes of structures
• Computable functors and effective interpretability
• Degree spectra and computable dimensions in algebraic structures
• Generic copies of countable structures
• Model theory.
• There is no classification of the decidably presentable structures
• Trivial, strongly minimal theories are model complete after naming constants

Cited in

(5)

• Expressive completeness and decidability
• scientific article; zbMATH DE number 1765670 (Why is no real title available?)
• Nearly Model Complete Theories
• Model completeness and relative decidability
• Decidability Results for Saturation-Based Model Building

This page was built for publication: Model completeness and relative decidability

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