Every recursive enumerable extension of a theory of linear order has a constructive model

DOI10.1007/BF02219295zbMath0298.02045OpenAlexW2068260603MaRDI QIDQ1214407

Mikhaĭl G. Peretyat'kin

Publication date: 1974

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

Full work available at URL: https://eudml.org/doc/186791

Mathematics Subject Classification ID

Model theory (03C99) Computability and recursion theory (03D99)

Related Items

Recursive models and the divisibility poset ⋮ Computable presentability of countable linear orders

Cites Work

• Introduction to model theory and to the metamathematics of algebra
• A formula with no recursively enumerable model

This page was built for publication: Every recursive enumerable extension of a theory of linear order has a constructive model