The basic constructive logic for negation-consistency
In a previous paper [ibid. 17, No.~1, 89--107 (2008; Zbl 1173.03027)], reviewed below, \textit{G. Robles} and \textit{J. M. Méndez} extended the Routley-Meyer basic positive logic \(\text{B}_+\) to \(\text{B}_{\text{K}+}\), by adding the rule K: \({\vdash A} \Rightarrow {\vdash B} \rightarrow A\), and then to \(\text{B}_{\text{Kc}1}\), \(\text{B}_{\text{Kc}2}\) and \(\text{B}_{\text{Kc}3}\) by also adding various negation axioms. They provided sound and complete Routley-Meyer-type semantics for these systems there. In this paper, the authors introduce negation extensions \(\text{B}_{\text{Kc}4}\) of \(\text{B}_{\text{Kc}1}\) and \(\text{B}_{\text{Kc}5}\) of \(\text{B}_{\text{Kc}2}\). These are shown to be independent of each other and also sound and complete under variants of the semantics for \(\text{B}_{\text{Kc}1}\). How \(\text{B}_{\text{Kc}2}\) and \(\text{B}_{\text{Kc}3}\) are related to \(\text{B}_{\text{Kc}4}\) and \(\text{B}_{\text{Kc}5}\) to \(\text{B}_{\text{Kc}3}\) is not discussed.
- The basic constructive logic for a weak sense of consistency
- The basic constructive logic for absolute consistency
- scientific article; zbMATH DE number 5300189
- The Basic Constructive Logic for a Weak Sense of Consistency defined with a Propositional Falsity Constant
- scientific article; zbMATH DE number 6287559
- scientific article; zbMATH DE number 3926879 (Why is no real title available?)
- scientific article; zbMATH DE number 4041868 (Why is no real title available?)
- scientific article; zbMATH DE number 2114314 (Why is no real title available?)
- Minimal negation in the ternary relational semantics
- Strong paraconsistency and the basic constructive logic for an even weaker sense of consistency
- The basic constructive logic for a weak sense of consistency
- The basic constructive logic for a weak sense of consistency
- The basic constructive logic for absolute consistency
- Two results in negation-free logic
- On negation: Pure local rules
- Negation as cancellation, and connexive logic
- A necessary condition for constructive negation in constraint logic programming
- Paraconsistent and paracomplete basic logics without classical negation and some of their extensions
- The Basic Constructive Logic for Absolute Consistency defined with a Propositional Falsity Constant
- scientific article; zbMATH DE number 5300189 (Why is no real title available?)
- Constructive negation, implication, and co-implication
- scientific article; zbMATH DE number 1749146 (Why is no real title available?)
- scientific article; zbMATH DE number 859801 (Why is no real title available?)
- Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations
- scientific article; zbMATH DE number 6287559 (Why is no real title available?)
- The basic constructive logic for weak consistency and the reductio axioms
- scientific article; zbMATH DE number 2213624 (Why is no real title available?)
- Strong paraconsistency and the basic constructive logic for an even weaker sense of consistency
This page was built for publication: The basic constructive logic for negation-consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006496)
