Recognition complexity of theories and their computational expressivity

DOI10.1007/S10469-012-9178-5zbMath1270.03064OpenAlexW2090578206MaRDI QIDQ694245

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

zbMATH Keywords

Boolean algebrasundecidable theoriescomputational complexity of a theorycomputational expressivity of a theory

Mathematics Subject Classification ID

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

Related Items (1)

A remark on a paper of I. V. Latkin

Cites Work

• Unnamed Item

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