Turing machine computations in finitely axiomatizable theories

DOI10.1007/BF01980636zbMath0567.03014OpenAlexW2331179602MaRDI QIDQ1059628

Mikhaĭl G. Peretyat'kin

Publication date: 1983

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

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

zbMATH Keywords

superstable theoryLindenbaum algebracomplexity of classes of formulasproperties of simple modelsrecursively enumerable theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10)

Related Items (1)

A.D. Taimanov and model theory in Kazakhstan

Cites Work

• Unnamed Item
• Unnamed Item
• Some aspects of generalized computability
• An application of games to the completeness problem for formalized theories
• One hundred and two problems in mathematical logic
• The Boolean algebra of logic
• Recursively presentable prime models
• On some conjectures connected with complete sentences
• Hierarchies of Boolean algebras

This page was built for publication: Turing machine computations in finitely axiomatizable theories