Switch to: References

Add citations

You must login to add citations.
  1. A truth-maker semantics for ST: refusing to climb the strict/tolerant hierarchy.Ulf Hlobil - 2022 - Synthese 200 (5):1-23.
    The paper presents a truth-maker semantics for Strict/Tolerant Logic (ST), which is the currently most popular logic among advocates of the non-transitive approach to paradoxes. Besides being interesting in itself, the truth-maker presentation of ST offers a new perspective on the recently discovered hierarchy of meta-inferences that, according to some, generalizes the idea behind ST. While fascinating from a mathematical perspective, there is no agreement on the philosophical significance of this hierarchy. I aim to show that there is no clear (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Why Must Incompatibility Be Symmetric?Ryan Simonelli - 2024 - Philosophical Quarterly 74 (2):658-682.
    Why must incompatibility be symmetric? An odd question, but recent work in the semantics of non-classical logic, which appeals to the notion of incompatibility as a primitive and defines negation in terms of it, has brought this question to the fore. Francesco Berto proposes such a semantics for negation argues that, since incompatibility must be symmetric, double negation introduction must be a law of negation. However, he offers no argument for the claim that incompatibility really must be symmetric. Here, I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Supposition: no Problem for Bilateralism.Ryan Simonelli - forthcoming - Bulletin of the Section of Logic:18 pp..
    In a recent paper, Nils Kürbis argues that bilateral natural deduction systems in which assertions and denials figure as hypothetical assumptions are unintelligible. In this paper, I respond to this claim on two counts. First, I argue that, if we think of bilateralism as a tool for articulating discursive norms, then supposition of assertions and denials in the context of bilateral natural deduction systems is perfectly intelligible. Second, I show that, by transposing such systems into sequent notation, one can make (...)
    Download  
     
    Export citation  
     
    Bookmark