Model completeness and relative decidability

DOI10.1007/S00153-020-00753-4OpenAlexW3119991094WikidataQ105642085 ScholiaQ105642085MaRDI QIDQ2042736FDOQ2042736

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)

Cites Work

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

Cited In (5)

• Model completeness and relative decidability
• Nearly Model Complete Theories
• Expressive completeness and decidability
• Decidability Results for Saturation-Based Model Building
• Title not available (Why is that?)

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)