Turing machine computations in finitely axiomatizable theories

DOI10.1007/BF01980636MaRDI QIDQ1059628zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4083594
• scientific article; zbMATH DE number 1357400
• THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
• Tarski’s finite basis problem via 𝐀(𝒯)
• scientific article; zbMATH DE number 1081433

Cites work

• scientific article; zbMATH DE number 3153134 (Why is no real title available?)
• scientific article; zbMATH DE number 3266604 (Why is no real title available?)
• An application of games to the completeness problem for formalized theories
• Hierarchies of Boolean algebras
• On some conjectures connected with complete sentences
• One hundred and two problems in mathematical logic
• Recursively presentable prime models
• Some aspects of generalized computability
• The Boolean algebra of logic

Cited in

(5)

• scientific article; zbMATH DE number 4152351 (Why is no real title available?)
• A.D. Taimanov and model theory in Kazakhstan
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• Definability by turing machines
• scientific article; zbMATH DE number 732055 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059628)