Recognition complexity of theories and their computational expressivity

DOI10.1007/S10469-012-9178-5zbMATH Open1270.03064OpenAlexW2090578206MaRDI QIDQ694245FDOQ694245

Authors: I. V. Latkin 

Publication date: 11 December 2012

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

Full work available at URL: https://doi.org/10.1007/s10469-012-9178-5

Recommendations

• The recognition complexity of decidable theories
• scientific article; zbMATH DE number 2203952
• scientific article; zbMATH DE number 2157312
• scientific article; zbMATH DE number 3979054
• Physical computational complexity and first-order logic

zbMATH Keywords

Boolean algebrascomputational complexity of a theorycomputational expressivity of a theoryundecidable theories

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
• A remark on a paper of I. V. Latkin
• The recognition complexity of decidable theories
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Recognition complexity of theories and their computational expressivity

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