General normal forms for any additive logic
From MaRDI portal
Abstract: In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on the set of formulas, so our normal forms cover logics with partial connectives too. We also show that most of the known normal forms in the literature are in fact particular cases of our general forms. These general normal forms are natural improvement of the distributive normal forms of J. Hintikka and their modal analogues, e.g. [Anderson] and [Fine].
Recommendations
- Normal forms in combinatory logic
- A generalization of the theory of normal forms
- A normal form for logical derivations implying one for arithmetic derivations
- scientific article; zbMATH DE number 1420808
- scientific article; zbMATH DE number 3966022
- scientific article; zbMATH DE number 475184
- Gaifman normal forms for counting extensions of first-order logic
- Representation of logic formulas by normal forms.
- scientific article; zbMATH DE number 5371703
- Simple Gentzenizations for the normal formulae of contraction-less logics
Cited in
(4)
This page was built for publication: General normal forms for any additive logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607851)