Switch to: References

Citations of:

Strict/Tolerant Logics Built Using Generalized Weak Kleene Logics

Melvin Fitting

Australasian Journal of Logic 18 (2) (2021)

Add citations

You must login to add citations.

A truth-maker semantics for ST: refusing to climb the strict/tolerant hierarchy.Ulf Hlobil - 2022 - Synthese 200 (5):1-23.details 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 2 citations
On Woodruff’s Constructive Nonsense Logic.Jonas R. B. Arenhart & Hitoshi Omori - 2024 - Studia Logica 112 (6):1261-1280.details Sören Halldén’s logic of nonsense is one of the most well-known many-valued logics available in the literature. In this paper, we discuss Peter Woodruff’s as yet rather unexplored attempt to advance a version of such a logic built on the top of a constructive logical basis. We start by recalling the basics of Woodruff’s system and by bringing to light some of its notable features. We then go on to elaborate on some of the difficulties attached to it; on our (...) Download Export citation Bookmark
On Three-Valued Presentations of Classical Logic.Bruno da Ré, Damian Szmuc, Emmanuel Chemla & Paul Égré - 2024 - Review of Symbolic Logic 17 (3):682-704.details Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...) Download Export citation Bookmark 1 citation
Monstrous Content and the Bounds of Discourse.Thomas Macaulay Ferguson - 2022 - Journal of Philosophical Logic 52 (1):111-143.details Bounds consequence provides an interpretation of a multiple-conclusion consequence relation in which the derivability of a sequent is understood as the claim that it is conversationally out-of-bounds to take a position in which each member of Γ is asserted while each member of Δ is denied. Two of the foremost champions of bounds consequence—Greg Restall and David Ripley—have independently indicated that the shape of the bounds in question is determined by conversational practice. In this paper, I suggest that the standard (...) Download Export citation Bookmark 1 citation

1