The logic BKc1 is the basic constructive logic for weak consistency in the ternary relational semantics without a set of designated points. In this paper, a number of extensions of B Kc1 defined with a propositional falsity constant are defined. It is also proved that weak consistency is not equivalent to negation-consistency or absolute consistency in any logic included in positive contractionless intermediate logic LC plus the constructive negation of BKc1 and the contraposition axioms.
A restriction of R-Mingle with the variable-sharing property and the Ackermann properties is defined. From an intuitive semantical point of view, this restriction is an alternative to Anderson and Belnap’s logic of entailment E.
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive logic BKc1 adequate to this sense of consistency in the ternary relational semantics without a set of designated points. Then we show how to define a series of logics extending BKc1 within the spectrum delimited by contractionless minimal intuitionistic logic. All logics defined in the paper are paraconsistent logics.
Routley-Meyer type ternary relational semantics are defined for relevant logics including Routley and Meyer’s basic logic B plus the reductio rule and the disjunctive syllogism. Standard relevant logics such as E and R (plus γ ) and Ackermann’s logics of ‘strenge Implikation’ Π and Π ′ are among the logics considered.
Routley–Meyer semantics (RM-semantics) is defined for Gödel 3-valued logic G3 and some logics related to it among which a paraconsistent one differing only from G3 in the interpretation of negation is to be remarked. The logics are defined in the Hilbert-style way and also by means of proof-theoretical and semantical consequence relations. The RM-semantics is defined upon the models for Routley and Meyer’s basic positive logic B+, the weakest positive RM-semantics. In this way, it is to be expected that the (...) models defined can be adapted to other related many-valued logics. (shrink)
The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of entailment. The aim of this paper is to define reduced general Routley-Meyer semantics for BN4 and E4. It is proved that BN4 and E4 are strongly sound and complete w.r.t. their respective semantics.
Łukasiewicz presented two different analyses of modal notions by means of many-valued logics: the linearly ordered systems Ł3,..., Open image in new window,..., \; the 4-valued logic Ł he defined in the last years of his career. Unfortunately, all these systems contain “Łukasiewicz type paradoxes”. On the other hand, Brady’s 4-valued logic BN4 is the basic 4-valued bilattice logic. The aim of this paper is to show that BN4 can be strengthened with modal operators following Łukasiewicz’s strategy for defining truth-functional (...) modal logics. The systems we define lack “Łukasiewicz type paradoxes”. Following Brady, we endow them with Belnap–Dunn type bivalent semantics. (shrink)
A simple, bivalent semantics is defined for Łukasiewicz’s 4-valued modal logic Łm4. It is shown that according to this semantics, the essential presupposition underlying Łm4 is the following: A is a theorem iff A is true conforming to both the reductionist and possibilist theses defined as follows: rt: the value of modal formulas is equivalent to the value of their respective argument iff A is true, etc.); pt: everything is possible. This presupposition highlights and explains all oddities arising in Łm4.
The aim of this paper is to define the logical system Sm4 characterised by the degree of truth-preserving consequence relation defined on the ordered set of values of Smiley’s four-element matrix MSm4. The matrix MSm4 has been of considerable importance in the development of relevant logics and it is at the origin of bilattice logics. It will be shown that Sm4 is a most interesting paraconsistent logic which encloses a sound theory of logical necessity similar to that of Anderson and (...) Belnap’s logic of entailment E. Intuitively, Sm4 can be described as a four-valued expansion of the positive fragment of Lewis’ S5 or, alternatively, as a four-valued version of S5. (shrink)
In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic BKc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending BKc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics.
The aim of this paper is to introduce an alternative to Łukasiewicz’s 4-valued modal logic Ł. As it is known, Ł is afflicted by “Łukasiewicz type paradoxes”. The logic we define, PŁ4, is a strong paraconsistent and paracomplete 4-valued modal logic free from this type of paradoxes. PŁ4 is determined by the degree of truth-preserving consequence relation defined on the ordered set of values of a modification of the matrix MŁ characteristic for the logic Ł. On the other hand, PŁ4 (...) is a rich logic in which a number of connectives can be defined. It also has a simple bivalent semantics of the Belnap–Dunn type. (shrink)
We provide Routley-Meyer type semantics for relevant logics including Contractionless Ticket Entailment TW (without the truth constant t and o) plus reductio R and Ackermann’s rule γ (i.e., disjunctive syllogism). These logics have the following properties. (i) All have the variable sharing property; some of them have, in addition, the Ackermann Property. (ii) They are stable. (iii) Inconsistent theories built upon these logics are not necessarily trivial.
A simple Henkin-style completeness proof for Gödel 3-valued propositional logic G3 is provided. The idea is to endow G3 with an under-determined semantics of the type defined by Dunn. The key concept in u-semantics is that of “under-determined interpretation”. It is shown that consistent prime theories built upon G3 can be understood as u-interpretations. In order to prove this fact we follow Brady by defining G3 as an extension of Anderson and Belnap’s positive fragment of First Degree Entailment Logic.
The logic B+ is Routley and Meyer’s basic positive logic. We define the logics BK+ and BK'+ by adding to B+ the K rule and to BK+ the characteristic S4 axiom, respectively. These logics are endowed with a relatively strong non-constructive negation. We prove that all the logics defined lack the K axiom and the standard paradoxes of consistency.
Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide (by using Dunn semantics) dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley (...) and Meyer’s basic positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)
Two versions of minimal intuitionism are defined restricting Contraction. Both are defined by means of a falsity constant F. The first one follows the historical trend, the second is the result of imposing specialconstraints on F. RelationaI ternary semantics are provided.
As is well known, the variable-sharing property (vsp) is, according to Anderson and Belnap, a necessary property of any relevant logic. In this paper, we shall consider two versions of the vsp, what we label the "weak vsp" (wvsp) and the "strong vsp" (svsp). In addition, the "no loose pieces property," a property related to the wvsp and the svsp, will be defined. Each one of these properties shall generally be characterized by means of a class of logical matrices. In (...) this way, any logic verified by an actual matrix in one of these classes has the property the class generally represents. Particular matrices (and so, logics) in each class are provided. (shrink)
The logic TM is the result of adding the mingle axiom, M to Ticket Entailment logic, T. In the present study, it is proved that TM has the variable-sharing property . Ternary relational semantics for TM is provided. Finally, an interesting extension of TM with the vsp is briefly discussed.
The logic B+ is Routley and Meyer's basic positive logic. We show how to introduce a minimal intuitionistic negation and an intuitionistic negation in B+. The two types of negation are introduced in a wide spectrum of relevance logics built up from B+. It is proved that although all these logics have the characteristic paradoxes of consistency, they lack the K rule.
In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F -consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F -consistency; (b) to define (...) the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant). (shrink)
In this paper, consistency is understood as absolute consistency (i.e. non-triviality). The basic constructive logic BKc6, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending BKc6 up to contractionless intuitionistic logic. All logics defined in this paper are paraconsistent logics.
The Converse Ackermann Property is the unprovability of formulas of the form (A -> B) -> C when C does contain neither -> nor ¬. Intuitively, the CAP amounts to rule out the derivability of pure non-necessitive propositions from non-necessitive ones. A constructive negation of the sort historically defined by, e.g., Johansson is added to positive logics with the CAP in the spectrum delimited by Ticket Entailment and Dummett’s logic LC.
The logic BKc6 is the basic constructive logic in the ternary relational semantics adequate to consistency understood as absolute consistency, i.e., non-triviality. Negation is introduced in BKc6 with a negation connective. The aim of this paper is to define the logic BKc6F. In this logic negation is introduced via a propositional falsity constant. We prove that BKc6 and BKc6F are definitionally equivalent. Then, we show how to extend BKc6F within the spectrum of logics delimited by contractionless intuitionistic logic. All logics (...) defined in the paper are paraconsistent logics. (shrink)
“Weak relevant model structures” (wr-ms) are defined on “weak relevant matrices” by generalizing Brady’s model structure ${\mathcal{M}_{\rm CL}}$ built upon Meyer’s Crystal matrix CL. It is shown how to falsify in any wr-ms the Generalized Modus Ponens axiom and similar schemes used to derive Curry’s Paradox. In the last section of the paper we discuss how to extend this method of falsification to more general schemes that could also be used in deriving Curry’s Paradox.
The logic TW+ is positive Ticket Entailment without the contraction axiom. Constructive negation is understood in the intuitionistic sense but without paradoxes of relevance. It is shown how to introduce a constructive negation of this kind in positive logics at least as strong as TW+. Special attention is paid to the reductio axioms. Concluding remarks about relevance, modal and entailment logics are stated. Complete relational ternary semantics are provided for the logics introduced in this paper.
Entendemos el concepto de “negación mínima” en el sentido clásico definido por Johansson. El propósito de este artículo es definir la lógica positiva mínima Bp+, y probar que la negación mínima puede introducirse en ella. Además, comentaremos algunas de las múltiples extensiones negativas de Bp+.“Minimal negation” is classically understood in a Johansson sense. The aim of this paper is to define the minimal positive logic Bp+ and prove that a minimal negation can be inroduced in it. In addition, some of (...) the many possible negation extensions of Bp+ are commented. (shrink)
As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series of paraconsistent logics (...) included in S4 where the Disjunctive Syllogism is valid only as a rule of proof. (shrink)
Sylvan and Plumwood’s is the relevant De Morgan minimal logic in the Routley-Meyer semantics with a set of designated points. The aim of this paper is to define the logic and some of its extensions. The logic is the non-relevant De Morgan minimal logic in the Routley-Meyer semantics without a set of designated points.
Entendemos el concepto de “negación mínima” en el sentido clásico definido por Johansson. El propósito de este artículo es definir la lógica positiva mínima Bp+, y probar que la negación mínima puede introducirse en ella. Además, comentaremos algunas de las múltiples extensiones negativas de Bp+.“Minimal negation” is classically understood in a Johansson sense. The aim of this paper is to define the minimal positive logic Bp+ and prove that a minimal negation can be inroduced in it. In addition, some of (...) the many possible negation extensions of Bp+ are commented. (shrink)
In the first part of this paper a minimal and an intuitionistic negation is introduced in a wide spectrum of relevance logics extending Routley and Meyer's basic positive logic B+. It is proved that although all these logics have the characteristic paradoxes of consistency, they lack the K rule. Negation is introduced with a propositional falsity constant. The aim of this paper is to build up logics definitionally equivalent to those in the aforementioned paper, negation being now introduced with the (...) unary connective. Relational ternary semantics are provided for the new logics and soundness and completeness results are proved. (shrink)