Turing machine computations in finitely axiomatizable theories

DOI10.1007/BF01980636zbMATH Open0567.03014OpenAlexW2331179602MaRDI QIDQ1059628FDOQ1059628

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

Recommendations

• scientific article
• 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

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)

Cites Work

• One hundred and two problems in mathematical logic
• An application of games to the completeness problem for formalized theories
• Title not available (Why is that?)
• On some conjectures connected with complete sentences
• Recursively presentable prime models
• Hierarchies of Boolean algebras
• The Boolean algebra of logic
• Some aspects of generalized computability
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Definability by turing machines
• A.D. Taimanov and model theory in Kazakhstan
• Title not available (Why is that?)
• Title not available (Why is that?)

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)