•  13
  •  23
    LCo with the Converse Ackermann Property is defined as the result of restricting Contraction in LC. Intuitionistic and Superintuitionistic Negation is shown to be compatible with the CAP.
  •  31
    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
  •  74
    The basic constructive logic for a weak sense of consistency
    Journal of Logic, Language and Information 17 (1): 89-107. 2008.
    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.
  •  31
    A prepositional logic S has the Converse Ackermann Property (CAP) if (AB)C is unprovable in S when C does not contain . In A Routley-Meyer semantics for Converse Ackermann Property (Journal of Philosophical Logic, 16 (1987), pp. 65–76) I showed how to derive positive logical systems with the CAP. There I conjectured that each of these positive systems were compatible with a so-called semiclassical negation. In the present paper I prove that this conjecture was right. Relational Routley-Meyer typ…Read more
  •  25
    Ł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 …Read more
  •  20
    Łukasiewicz 3-valued logic Ł3 is often understood as the set of all valid formulas according to Łukasiewicz 3-valued matrices MŁ3. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: ‘truth-preserving’ Ł3a and ‘well-determined’ Ł3b defined by two different consequence relations on the 3-valued matrices MŁ3. The aim of this article is to provide a Routley–Meyer ternary semantics for each one of these three versions of Łukasiewicz 3-valued logic: Ł3, Ł3a and Ł…Read more
  •  21
    1. Select list of representative theses
    Bulletin of the Section of Logic 17 (1): 15-20. 1988.
  •  76
    A constructive negation for logics including TW+
    Journal of Applied Non-Classical Logics 15 (4): 389-404. 2005.
    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 pa…Read more
  •  31
    The compatibility of relevance and Mingle
    Journal of Philosophical Logic 17 (3). 1988.
  •  16
    The non-relevant De Morgan minimal logic in Routley-Meyer semantics with no designated points
    Journal of Applied Non-Classical Logics 24 (4): 321-332. 2014.
    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
  •  24
    Erratum to: The compatibility of relevance and Mingle (review)
    Journal of Philosophical Logic 39 (3): 339-339. 2010.
  •  36
    Paraconsistent logics included in Lewis’ S4
    Review of Symbolic Logic 3 (3): 442-466. 2010.
    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 …Read more
  •  20
    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
  •  441
    A modal restriction of R-Mingle with the variable-sharing property
    with Gemma Robles and Francisco Salto
    Logic and Logical Philosophy 19 (4): 341-351. 2010.
    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
  •  81
    A natural negation completion of Urquhart's many-valued logic C
    Journal of Philosophical Logic 27 (1): 75-84. 1998.
    Etude de l'extension par la negation semi-intuitionniste de la logique positive des propositions appelee logique C, developpee par A. Urquhart afin de definir une semantique relationnelle valable pour la logique des valeurs infinies de Lukasiewicz (Lw). Evitant les axiomes de contraction et de reduction propres a la logique classique de Dummett, l'A. propose une semantique de type Routley-Meyer pour le systeme d'Urquhart (CI) en tant que celle-la ne fournit que des theories consistantes pour la …Read more
  •  13
    Urquhart'sc with minimal negation
    Bulletin of the Section of Logic 19 (1): 15-20. 1990.
  •  39
    Two extensions of Lewis' s3 with Peirce's law
    Theoria 14 (3): 407-411. 1999.
    We define two extensions of Lewis’ S3 with two versions of Peirce’s Law. We prove that both of them have the Ackermann Property
  •  34
    Strengthening Brady’s Paraconsistent 4-Valued Logic BN4 with Truth-Functional Modal Operators
    Journal of Logic, Language and Information 25 (2): 163-189. 2016.
    Ł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…Read more
  •  30
    Constructive R
    Bulletin of the Section of Logic 16 (4): 167-173. 1987.
    Let R+ be the positive fragment of Anderson and Belnap’s Logic of Relevance, R. And let RMO+ be the result of adding the Mingle principle ) to R+. We have shown in [2] that either a minimal negation or else a semiclassical one can be added to RMO+ preserving the variable-sharing property. Moreover, each of there systems is given a semantics in the Routley-Meyer style. In describing in [2] the models for RMO+ plus minimal negation, we noted that a similar strategy would give us a semantics for R+…Read more
  • Exhaustively Axiomatizing S3 (->) degrees and S4 (->) degrees
    Teorema: International Journal of Philosophy 27 (2): 79-89. 2008.
    S3o and S4o are the restrictions with the Converse Ackermann Property of the implicative fragments of Lewis' S3 and S4 respectively. The aim of this paper is to provide all possible axiomatizations with independent axioms of S3o and S40 that can be formulated with a modification of Anderson and Belnap's list of valid entailments.
  •  84
    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.
  •  28
    We provide all possible axiomatizations with independent axioms of E→ and R→ formulable with Anderson and Belnap’s list
  •  19
    A Class of Simpler Logical Matrices for the Variable-Sharing Property
    with G. Robles
    Logic and Logical Philosophy 20 (3): 241-249. 2011.
    In our paper “A general characterization of the variable-sharing property by means of logical matrices”, a general class of so-called “Relevant logical matrices”, RMLs, is defined. The aim of this paper is to define a class of simpler Relevant logical matrices RMLs′serving the same purpose that RMLs, to wit: any logic verified by an RML′has the variable-sharing property and related properties predicable of the logic of entailment E and of the logic of relevance R
  •  15
    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
  •  110
    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
  •  32
    Routley- Meyer type relational complete semantics are constructed for intuitionistic contractionless logic with reductio. Different negation completions of positive intuitionistic logic without contraction are treated in a systematical, unified and semantically complete setting