Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types

DOI10.1007/S10958-022-06153-8OpenAlexW4308072627MaRDI QIDQ6187997

E. Khlestova

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-022-06153-8

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
• Criterion for strong constructivizability of a homogeneous model
• Strong constructivizability of homogeneous models
• Model theory.
• On complete theories with a finite number of denumerable models
• Decidable models
• A complete, decidable theory with two decidable models

This page was built for publication: Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types