•  8
    Connexive Negation
    Studia Logica 112 (1): 511-539. 2023.
    Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, n…Read more
  •  72
    Connexive Negation
    Studia Logica (Special Issue: Frontiers of Conn): 1-29. 2023.
    Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, n…Read more
  •  108
    Relating Semantics for Hyper-Connexive and Totally Connexive Logics
    Logic and Logical Philosophy (Special Issue: Relating Logic a): 1-14. 2023.
    In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.
  •  4
    A Note on Three Approaches to Connexivity
    Felsefe Arkivi 51 129-138. 2019.
    In this paper I explore whether three different approaches to connexivity – namely, Lewis and Langford’s, Wansing’s and Egré and Politzer’s – can be non-trivially related. Lewis and Langford’s approach consists of the definition of the conditional in terms of consistency via the definition of possibility in terms of consistency and Lewis’ definition of the (strict) conditional in terms of possibility; Wansing’s approach is based on his definition of the falsity condition for the conditional as “…Read more
  •  24
    Sí hay negación lógica
    Critica 52 (155): 55-72. 2020.
    En este artículo discutimos la tesis de Jc Beall según la cual no hay negación lógica. Evaluamos la solidez del argumento con el que defiende su tesis y presentamos dos razones para rechazar una de sus premisas: que la negación tiene que ser excluyente o exhaustiva. La primera razón involucra una presentación alternativa de las reglas de la negación en sistemas de secuentes diferentes al que Beall presupone. La segunda razón establece que la negación no tiene que ser excluyente o exhaustiva.