Switch to: References

Add citations

You must login to add citations.
  1. Proof Systems for Super- Strict Implication.Guido Gherardi, Eugenio Orlandelli & Eric Raidl - 2024 - Studia Logica 112 (1):249-294.
    This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof Systems for Super- Strict Implication.Guido Gherardi, Eugenio Orlandelli & Eric Raidl - 2023 - Studia Logica 112 (1):249-294.
    This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Connexive Logic, Connexivity, and Connexivism: Remarks on Terminology.Heinrich Wansing & Hitoshi Omori - 2023 - Studia Logica 112 (1):1-35.
    Over the past ten years, the community researching connexive logics is rapidly growing and a number of papers have been published. However, when it comes to the terminology used in connexive logic, it seems to be not without problems. In this introduction, we aim at making a contribution towards both unifying and reducing the terminology. We hope that this can help making it easier to survey and access the field from outside the community of connexive logicians. Along the way, we (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • The Implicative Conditional.Eric Raidl & Gilberto Gomes - 2023 - Journal of Philosophical Logic 53 (1):1-47.
    This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. $${p\Rightarrow q}$$ p ⇒ q is thus defined as $${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$ ¬ ◊ (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Connexive Implications in Substructural Logics.Davide Fazio & Gavin St John - forthcoming - Review of Symbolic Logic:1-32.
    This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FL ${}_{\scriptsize\mbox{e}}$ -algebras). In particular, we inquire into sufficient and necessary conditions under which generalizations of the connexive implication-like operation defined in [6] for Heyting algebras still satisfy connexive theses. It will turn out that, in most cases, connexive principles are equivalent to the equational Glivenko property with respect to Boolean algebras. Furthermore, we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations