On decomposability in logical calculi
From MaRDI portal
Publication:2882946
zbMATH Open1249.03044MaRDI QIDQ2882946FDOQ2882946
Authors: Denis Ponomaryov 
Publication date: 11 May 2012
Published in: Joint Bulletin of the Novosibirsk Computing Center (NCC) and A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3900750
- On decidability of the decomposability problem for finite theories
- A decomposition rule for the Hoare logic
- Strong paraconsistency by separating composition and decomposition in classical logic
- Splittings in varieties of logic
- Generalized decomposability notions for first-order theories
- Decidable properties of logical calculi and of varieties of algebras
- Decomposability and computability
- On decomposability of theories
- scientific article; zbMATH DE number 3394053
Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40)
Cited In (12)
- Feferman-vaught decompositions for prefix classes of first order logic
- On decidability of the decomposability problem for finite theories
- Algorithmic issues of AND-decomposition of Boolean formulas
- Title not available (Why is that?)
- On decomposability of theories
- Title not available (Why is that?)
- Progression of decomposed local-effect action theories
- AND-decomposition of Boolean polynomials with prescribed shared variables
- Title not available (Why is that?)
- The complexity of AND-decomposition of Boolean functions
- On the relationship between the complexity of decidability and decomposability of first-order theories
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
This page was built for publication: On decomposability in logical calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882946)
