• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

José M. Méndez

Universidad de Salamanca
  •  Home
  •  Publications
    97
    • Most Recent
    • Most Downloaded
    • Topics
  •  News and Updates
    75

 More details
  • Universidad de Salamanca
    Retired faculty
Universidad de Salamanca
PhD
Homepage
Salamanca, Castile and León, Spain
0000-0002-9560-3327
Areas of Specialization
Logic and Philosophy of Logic
Nonclassical Logics
Intuitionistic Logic
Many-Valued Logic
Paraconsistent Logic
Relevance Logic
Substructural Logic
Logical Consequence and Entailment
3 more
Areas of Interest
Logic and Philosophy of Logic
Logics
Nonclassical Logics
Intuitionistic Logic
Many-Valued Logic
Paraconsistent Logic
Relevance Logic
Substructural Logic
Logical Consequence and Entailment
4 more
  • All publications (97)
  •  81
    Dual Equivalent Two-valued Under-determined and Over-determined Interpretations for Łukasiewicz’s 3-valued Logic Ł3
    with Gemma Robles and Francisco Salto
    Journal of Philosophical Logic 43 (2-3): 303-332. 2014.
    Ł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 dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic…Read more
    Ł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 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.
    Logic and Philosophy of Logic
  •  22
    Exhaustively axiomatizing RMO with an appropiate extension of Anderson and Belnap’s “strong and natural list of valid entailments”
    Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 5 (1-2): 223-228. 1990.
    RMO -> is the result of adding the ‘mingle principle’ (viz. A-> (A -> A)) to Anderson and Belnap’s implicative logic of relevance R->. The aim of this paper is to provide all possible axiomatizations with independent axioms of RMO -> formulable with Anderson and Belnap’s list extended with three characteristic minglish principles.
    Science, Logic, and MathematicsRelevance Logic
  •  51
    El sistema Bp+ : una lógica positiva mínima para la negación mínima (The system Bp+: a minimal positive logic for minimal negation)
    with Francisco Salto and Gemma Robles
    Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 22 (1): 81-91. 2007.
    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,…Read more
    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.
    Relevance LogicIntuitionistic LogicMany-Valued LogicSubstructural LogicLogical Consequence and Entai…Read more
    Relevance LogicIntuitionistic LogicMany-Valued LogicSubstructural LogicLogical Consequence and Entailment
  •  96
    Urquhart's C with Intuitionistic Negation: Dummett's LC without the Contraction Axiom
    with Francisco Salto
    Notre Dame Journal of Formal Logic 36 (3): 407-413. 1995.
    This paper offers a particular intuitionistic negation completion of Urquhart's system C resulting in a super-intuitionistic contractionless propositional logic equivalent to Dummett's LC without contraction
    Logic and Philosophy of LogicIntuitionistic Logic
  •  71
    Systems with the converse Ackermann property
    Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 1 (1): 253-258. 1985.
    A system S has the “converse Ackermann property” (C.A.P.) if (A -> B) -> C is unprovable in S whenever C is a propositional variable. In this paper we define the fragments with the C.A.P. of some well-know propositional systems in the spectrum between the minimal and classical logic. In the first part we succesively study the implicative and positive fragments and the full calculi. In the second, we prove by a matrix method that each one of the systems has the C.A.P. Thus, we think the problem p…Read more
    A system S has the “converse Ackermann property” (C.A.P.) if (A -> B) -> C is unprovable in S whenever C is a propositional variable. In this paper we define the fragments with the C.A.P. of some well-know propositional systems in the spectrum between the minimal and classical logic. In the first part we succesively study the implicative and positive fragments and the full calculi. In the second, we prove by a matrix method that each one of the systems has the C.A.P. Thus, we think the problem proposed in Anderson & Belnap (1975) § 8.12 has been solved.
    Relevance LogicMathematical Logic
  • Lógica intuicionista en tres horas
    with Francisco Alemany
    Laguna 9. 2001.
  • Relevance Logics, Paradoxes Of Consistency And The K Rule Ii
    with Gemma Robles
    Logic and Logical Philosophy 15 175-191. 2006.
    The logic B+ is Routley and Meyer’s basic positive logic. Wedefine the logics BK+ and BK′+ by adding to B+ the K rule and to BK+the characteristic S4 axiom, respectively. These logics are endowed witha relatively strong non-constructive negation. We prove that all the logicsdefined lack the K axiom and the standard paradoxes of consistency
    Nonclassical Logics
  • Minimal Non-relevant Logics Without The K Axiom
    with Gemma Robles
    Reports on Mathematical Logic. 2007.
    The logic B$_{+}$ is Routley and Meyer's basic positive logic. The logic B$_{K+}$ is B$_{+}$ plus the $K$ rule. We add to B$_{K+}$ four intuitionistic-type negations. We show how to extend the resulting logics within the modal and relevance spectra. We prove that all the logics defined lack the K axiom.
  •  40
    Exhaustively Axiomatizing S3°→ and S4°→
    with Gemma Robles and Francisco Salto
    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 S4o that can be formulated with a modification of Anderson and Belnap's list of valid entailments.
    Substructural LogicRelevance LogicDegrees of BeliefLogical Consequence and Entailment
  •  60
    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
    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+ with minimal negation; that is, constructive R. The aim of this paper is to prove this claim
  •  134
    A Routley-Meyer type semantics for relevant logics including B r plus the disjunctive syllogism
    with Gemma Robles
    Journal of Philosophical Logic 39 (2): 139-158. 2010.
    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.
    Logic and Philosophy of LogicRelevance LogicLogical Semantics and Logical TruthMathematical Logic
  •  59
    Axiomatizing E→ and R→ with Anderson and Belnap's 'strong and natural'list of valid entailments
    Bulletin of the Section of Logic 16 (1): 2-7. 1987.
    We provide all possible axiomatizations with independent axioms of E→ and R→ formulable with Anderson and Belnap’s list
    Logic and Philosophy of LogicRelevance Logic
  •  119
    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
    Logic and Philosophy of LogicNonclassical Logics
  •  114
    Ticket Entailment plus the mingle axiom has the variable-sharing property
    with Gemma Robles and Francisco Salto
    Logic Journal of the IGPL 20 (1): 355-364. 2012.
    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
    Nonclassical LogicsLogical Consequence and EntailmentLogics, Misc
  •  46
    Exhaustively axiomatizing rmo→ with a select list of representative theses including restricted Mingle principles
    with Francisco Salto and Gemma Robles
    Bulletin of the Section of Logic 28 (4): 195-206. 1999.
  •  107
    Strong paraconsistency and the basic constructive logic for an even weaker sense of consistency
    with Gemma Robles
    Journal of Logic, Language and Information 18 (3): 357-402. 2009.
    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…Read more
    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).
    Paraconsistent Logic
  •  105
    Intuitionistic propositional logic without 'contraction' but with 'reductio'
    with F. Salto
    Studia Logica 66 (3): 409-418. 2000.
    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
    Intuitionistic LogicSubstructural Logic
  •  7
    Constructive negation defined with a falsity constant for positive logics with the cap defined with a truth constant
    with Gemma Robles
    Logique Et Analyse 48 (192): 87-100. 2005.
    Metaphysics and EpistemologyNegation
  •  646
    A Routley-Meyer semantics for Ackermann's logics of “strenge implication”
    Logic and Logical Philosophy 18 (3-4): 191-219. 2009.
    The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π ′ and Π ′′ . Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π ′ and Π ′′ are proved. A brief discussion on Π ′ , Π ′′ and paraconsistency is included
    Logic and Philosophy of LogicRelevance Logic
  •  93
    A paraconsistent 3-valued logic related to Godel logic G3
    with G. Robles
    Logic Journal of the IGPL 22 (4): 515-538. 2014.
    Science, Logic, and MathematicsNonclassical Logics
  •  48
    Adding the disjunctive syllogism to relevant logics including TW plus the contraction and reductio rules
    with Gemma Robles and Francisco Salto
    Logique Et Analyse 54 (215): 343-358. 2011.
    In this paper, it is shown how to define a Routley-Meyer type ternary relational semantics for relevant logics including contractionless Ticket Entailment TW plus the contraction and reductio rules. Standard relevant logics such as E and R plus γ are among the logics considered. © 2011 Elsevier B.V., All rights reserved.
    Propositional AttitudesLogic and Philosophy of Logic
  •  144
    A binary Routley semantics for intuitionistic De Morgan minimal logic HM and its extensions
    with G. Robles
    Logic Journal of the IGPL 23 (2): 174-193. 2015.
    Science, Logic, and MathematicsNonclassical LogicsIntuitionistic Logic
  •  98
    The basic constructive logic for absolute consistency
    with Gemma Robles
    Journal of Logic, Language and Information 18 (2): 199-216. 2009.
    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.
    Intuitionistic LogicParaconsistent Logic
  •  89
    The logic B and the reductio axioms
    with Gemma Robles
    Bulletin of the Section of Logic 33 (2): 87-94. 2004.
    Mathematical Logic
  •  84
    Generalizing the Depth Relevance Condition: Deep Relevant Logics Not Included in R-Mingle
    with Gemma Robles
    Notre Dame Journal of Formal Logic 55 (1): 107-127. 2014.
    Logic and Philosophy of LogicRelevance Logic
  •  63
    Exhaustively axiomatizing RMO with an appropiate extension of Anderson and Belnap's “strong and natural list of valid entailments”
    Theoria 5 (1): 223-228. 1990.
    RMO -> is the result of adding the ‘mingle principle’ (viz. A-> (A -> A)) to Anderson and Belnap’s implicative logic of relevance R->. The aim of this paper is to provide all possible axiomatizations with independent axioms of RMO -> formulable with Anderson and Belnap’s list extended with three characteristic minglish principles
    Science, Logic, and MathematicsRelevance Logic
  •  72
    Axiomatizing s4+ and j+ without the suffixing, prefixing and self-distribution of the conditional axioms
    with Gemma Robles
    Bulletin of the Section of Logic 39 (1/2): 79-91. 2010.
    Areas of Mathematics
  •  91
    An Interpretation of Łukasiewicz’s 4-Valued Modal Logic
    with Gemma Robles and Francisco Salto
    Journal of Philosophical Logic 45 (1): 73-87. 2016.
    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 arisi…Read more
    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
    Nonclassical LogicsLogical Consequence and EntailmentModal Logic
  •  98
    A companion to Brady's 4-valued relevant logic BN4: The 4-valued logic of entailment E4
    with Gemma Robles
    Logic Journal of the IGPL 24 (5). 2016.
    Nonclassical Logics
  •  105
    A note on "Recent work in relevant logic"
    In his paper “Recent work in relevant logic”, Jago includes a section on Disjunctive Syllogism . The content of the section essentially consists of (a) a valuation of some work by Robles and Méndez on the topic as “not particularly interesting in itself”; (b) a statement establishing that “What would be interesting is to discover just how weak a relevant logic needs to be before disjunctive syllogism becomes inadmissible”. The main problem with this section of Jago’s paper on DS is that the auth…Read more
    In his paper “Recent work in relevant logic”, Jago includes a section on Disjunctive Syllogism . The content of the section essentially consists of (a) a valuation of some work by Robles and Méndez on the topic as “not particularly interesting in itself”; (b) a statement establishing that “What would be interesting is to discover just how weak a relevant logic needs to be before disjunctive syllogism becomes inadmissible”. The main problem with this section of Jago’s paper on DS is that the author is unaware of the recent important results on the topic. I show that (1) the valuation in (a) is groundless and (2) the ill-formulated problem in (b) is solved in the recent literature on relevant logics.
    Relevance Logic
  • Prev.
  • 1
  • 2
  • 3
  • 4
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback