Switch to: Citations

Add references

You must login to add references.
  1. Tolerance and Mixed Consequence in the S'valuationist Setting.Pablo Cobreros, Paul Egré, David Ripley & Robert Rooij - 2012 - Studia Logica 100 (4):855-877.
    In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Paradoxes and Failures of Cut.David Ripley - 2013 - Australasian Journal of Philosophy 91 (1):139 - 164.
    This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...)
    Download  
     
    Export citation  
     
    Bookmark   160 citations  
  • Conservatively extending classical logic with transparent truth.David Ripley - 2012 - Review of Symbolic Logic 5 (2):354-378.
    This paper shows how to conservatively extend classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth—involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is nontransitive. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system allows for Cut—elimination, but the (...)
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • Tolerant, Classical, Strict.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2012 - Journal of Philosophical Logic 41 (2):347-385.
    In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...)
    Download  
     
    Export citation  
     
    Bookmark   158 citations  
  • How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
    Download  
     
    Export citation  
     
    Bookmark   158 citations  
  • Intuitive semantics for first-degree entailments and 'coupled trees'.J. Michael Dunn - 1976 - Philosophical Studies 29 (3):149-168.
    Download  
     
    Export citation  
     
    Bookmark   236 citations  
  • Intensional relations.Everett J. Nelson - 1930 - Mind 39 (156):440-453.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
    A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.
    Download  
     
    Export citation  
     
    Bookmark   882 citations  
  • ST, LP and Tolerant Metainferences.Bogdan Dicher & Francesco Paoli - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 383-407.
    The strict-tolerant approach to paradox promises to erect theories of naïve truth and tolerant vagueness on the firm bedrock of classical logic. We assess the extent to which this claim is founded. Building on some results by Girard we show that the usual proof-theoretic formulation of propositional ST in terms of the classical sequent calculus without primitive Cut is incomplete with respect to ST-valid metainferences, and exhibit a complete calculus for the same class of metainferences. We also argue that the (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • A Hierarchy of Classical and Paraconsistent Logics.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Journal of Philosophical Logic 49 (1):93-120.
    In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Reaching Transparent Truth.Pablo Cobreros, Paul Égré, David Ripley & Robert van Rooij - 2013 - Mind 122 (488):841-866.
    This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.
    Download  
     
    Export citation  
     
    Bookmark   128 citations  
  • A Simple Logical Matrix and Sequent Calculus for Parry’s Logic of Analytic Implication.Damian E. Szmuc - 2021 - Studia Logica 109 (4):791-828.
    We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Weak Necessity on Weak Kleene Matrices.Fabrice Correia - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 73-90.
    A possible world semantics for standard modal languages is presented, where the valuation functions are allowed to be partial, the truth–functional connectives are interpreted according to weak Kleene matrices, and the necessity operator is given a “weak” interpretation. Completeness and incompleteness results for some (axiomatic) systems are then established. Extensions of these modal logics in which figure “statability” operators are also examined.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Simple Hyperintensional Belief Revision.F. Berto - 2018 - Erkenntnis 84 (3):559-575.
    I present a possible worlds semantics for a hyperintensional belief revision operator, which reduces the logical idealization of cognitive agents affecting similar operators in doxastic and epistemic logics, as well as in standard AGM belief revision theory. (Revised) belief states are not closed under classical logical consequence; revising by inconsistent information does not perforce lead to trivialization; and revision can be subject to ‘framing effects’: logically or necessarily equivalent contents can lead to different revisions. Such results are obtained without resorting (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • A modal restriction of R-Mingle with the variable-sharing property.Gemma Robles, José M. Méndez & Francisco Salto - 2010 - Logic and Logical Philosophy 19 (4):341-351.
    A restriction of R-Mingle with the variable-sharing property and the Ackermann properties is defined. From an intuitive semantical point of view, this restriction is an alternative to Anderson and Belnap’s logic of entailment E.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A General Characterization of the Variable-Sharing Property by Means of Logical Matrices.Gemma Robles & José M. Méndez - 2012 - Notre Dame Journal of Formal Logic 53 (2):223-244.
    As is well known, the variable-sharing property (vsp) is, according to Anderson and Belnap, a necessary property of any relevant logic. In this paper, we shall consider two versions of the vsp, what we label the "weak vsp" (wvsp) and the "strong vsp" (svsp). In addition, the "no loose pieces property," a property related to the wvsp and the svsp, will be defined. Each one of these properties shall generally be characterized by means of a class of logical matrices. In (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • The Strict/Tolerant Idea and Bilattices.Melvin Fitting - 2021 - In Ofer Arieli & Anna Zamansky (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Springer Verlag. pp. 167-191.
    Strict/tolerant logic is a formally defined logic that has the same consequence relation as classical logic, though it differs from classical logic at the metaconsequence level. Specifically, it does not satisfy a cut rule. It has been proposed for use in work on theories of truth because it avoids some objectionable features arising from the use of classical logic. Here we are not interested in applications, but in the formal details themselves. We show that a wide range of logics have (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Proof Theory of Paraconsistent Weak Kleene Logic.Francesco Paoli & Michele Pra Baldi - 2020 - Studia Logica 108 (4):779-802.
    Paraconsistent Weak Kleene Logic is the 3-valued propositional logic defined on the weak Kleene tables and with two designated values. Most of the existing proof systems for PWK are characterised by the presence of linguistic restrictions on some of their rules. This feature can be seen as a shortcoming. We provide a cut-free calculus for PWK that is devoid of such provisos. Moreover, we introduce a Priest-style tableaux calculus for PWK.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Formalization of a plausible inference.Szymon Frankowski - 2004 - Bulletin of the Section of Logic 33 (1):41--52.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Classical Logic and the Strict Tolerant Hierarchy.Chris Scambler - 2020 - Journal of Philosophical Logic 49 (2):351-370.
    In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number n, there is a logic which (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Weak Necessity on Weak Kleene Matrices.Fabrice Correia - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 73-90.
    A possible world semantics for standard modal languages is presented, where the valuation functions are allowed to be partial, the truth--functional connectives are interpreted according to weak Kleene matrices, and the necessity operator is given a "weak" interpretation. Completeness and incompleteness results for some (axiomatic) systems are then established. Extensions of these modal logics in which figure "statability" operators are also examined.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Class of Simpler Logical Matrices for the Variable-Sharing Property.G. Robles & J. M. Méndez - 2011 - Logic and Logical Philosophy 20 (3):241-249.
    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.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Simple Sequent Calculus for Angell’s Logic of Analytic Containment.Rohan French - 2017 - Studia Logica 105 (5):971-994.
    We give a simple sequent calculus presentation of R.B. Angell’s logic of analytic containment, recently championed by Kit Fine as a plausible logic of partial content.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Some remarks on the consequence operation in sentential logics.Ryszard Wójcicki - 1970 - Fundamenta Mathematicae 68 (1):269--279.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Variable Sharing in Substructural Logics: An Algebraic Characterization.Guillermo Badia - 2018 - Bulletin of the Section of Logic 47 (2):107-115.
    We characterize the non-trivial substructural logics having the variable sharing property as well as its strong version. To this end, we find the algebraic counterparts over varieties of these logical properties. -/- .
    Download  
     
    Export citation  
     
    Bookmark   1 citation