Complexity of Ehrenfeucht models

DOI10.1007/S10469-006-0027-2zbMath1164.03327OpenAlexW1967631238MaRDI QIDQ3546055

Aleksandr Nikolaevich Gavryushkin

Publication date: 18 December 2008

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-006-0027-2

zbMATH Keywords

constructive modelEhrenfeucht theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (1)

Autostability of prime models under strong constructivizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
• Model theory.
• On complete theories with a finite number of denumerable models
• The uncountable spectra of countable theories
• Theories with recursive models
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Complexity of Categorical Theories with Computable Models

This page was built for publication: Complexity of Ehrenfeucht models