On decidability of the decomposability problem for finite theories

DOI10.1007/S11202-010-0068-6zbMATH Open1226.03022OpenAlexW2011298343MaRDI QIDQ630293FDOQ630293

Authors Andrei S. Morozov, Denis Ponomaryov

Publication date 17 March 2011

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11202-010-0068-6

zbMATH Keywords

logic programmingdecomposable theorydecomposition of a theoryHorn theorymonadic logic

Mathematics Subject Classification ID

Logic programming (68N17) Decidability of theories and sets of sentences (03B25)

Recommendations

• On decomposability of theories
• Generalized decomposability notions for first-order theories
• Decomposable theories
• A decidable variety that is finitely undecidable
• Undecidable fragments of elementary theories

Cites work

• scientific article; zbMATH DE number 4025396 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 3404221 (Why is no real title available?)
• Extracting Modules from Ontologies: A Logic-Based Approach
• Formal Properties of Modularisation
• Modular reuse of ontologies: theory and practice
• On decomposability in logical calculi
• Partition-based logical reasoning for first-order and propositional theories

Cited in

(14)

• On the relationship between the complexity of decidability and decomposability of first-order theories
• scientific article; zbMATH DE number 3871315 (Why is no real title available?)
• On decomposability in logical calculi
• The complexity of AND-decomposition of Boolean functions
• Generalized decomposability notions for first-order theories
• A formal derivation of the decidability of the theory SA
• A note on the decidability of de Finetti's coherence
• Progression of decomposed local-effect action theories
• On decomposability of theories
• On decidability of the theory with the transitive closure operator
• Decidability and complexity of fibred logics without shared connectives
• A remark concerning decidability of complete theories
• Algorithmic issues of AND-decomposition of Boolean formulas
• Universal Horn Sentences and the Joint Embedding Property

This page was built for publication: On decidability of the decomposability problem for finite theories

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