On the relationship between the complexity of decidability and decomposability of first-order theories

DOI10.1134/S199508022112026XOpenAlexW4200384650MaRDI QIDQ2062094

Yanyan Li

Publication date: 22 December 2021

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199508022112026x

zbMATH Keywords

computational complexitydecompositiondecidability

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• On decidability of the decomposability problem for finite theories
• The complexity of AND-decomposition of Boolean functions
• Handbook on Ontologies
• Mathematical Logic for Life Science Ontologies
• Progression of Decomposed Local-Effect Action Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the relationship between the complexity of decidability and decomposability of first-order theories