On decomposability in logical calculi
From MaRDI portal
Publication:2882946
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
Cited in
(12)- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- 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
- scientific article; zbMATH DE number 3269892 (Why is no real title available?)
- On decomposability of theories
- scientific article; zbMATH DE number 5847329 (Why is no real title available?)
- AND-decomposition of Boolean polynomials with prescribed shared variables
- Progression of decomposed local-effect action theories
- scientific article; zbMATH DE number 219946 (Why is no real title available?)
- The complexity of AND-decomposition of Boolean functions
- On the relationship between the complexity of decidability and decomposability of first-order theories
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)