Switch to: Citations

Add references

You must login to add references.
  1. A paraconsistent route to semantic closure.Eduardo Alejandro Barrio, Federico Matias Pailos & Damian Enrique Szmuc - 2017 - Logic Journal of the IGPL 25 (4):387-407.
    In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound and (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Multisets and relevant implication I.Robert K. Meyer & Michael A. McRobbie - 1982 - Australasian Journal of Philosophy 60 (2):107 – 139.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Multisets and Relevant Implication.R. K. Meyer - 1982 - Australasian Journal of Philosophy 60:107.
    Download  
     
    Export citation  
     
    Bookmark   20 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   42 citations  
  • On All Strong Kleene Generalizations of Classical Logic.Stefan Wintein - 2016 - Studia Logica 104 (3):503-545.
    By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Towards a Non-classical Meta-theory for Substructural Approaches to Paradox.Lucas Rosenblatt - 2021 - Journal of Philosophical Logic 50 (5):1007-1055.
    In the literature on self-referential paradoxes one of the hardest and most challenging problems is that of revenge. This problem can take many shapes, but, typically, it besets non-classical accounts of some semantic notion, such as truth, that depend on a set of classically defined meta-theoretic concepts, like validity, consistency, and so on. A particularly troubling form of revenge that has received a lot of attention lately involves the concept of validity. The difficulty lies in that the non-classical logician cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   5 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   118 citations  
  • Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics.Adam Přenosil - 2017 - Studia Logica 105 (6):1255-1289.
    We develop a Gentzen-style proof theory for super-Belnap logics, expanding on an approach initiated by Pynko. We show that just like substructural logics may be understood proof-theoretically as logics which relax the structural rules of classical logic but keep its logical rules as well as the rules of Identity and Cut, super-Belnap logics may be seen as logics which relax Identity and Cut but keep the logical rules as well as the structural rules of classical logic. A generalization of the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A fully classical truth theory characterized by substructural means.Federico Matías Pailos - 2020 - Review of Symbolic Logic 13 (2):249-268.
    We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of consequence relations (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • A family of metainferential logics.Federico Matias Pailos - 2019 - Journal of Applied Non-Classical Logics 29 (1):97-120.
    ABSTRACTWe will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or. We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Multisets and relevant implication II.Robert K. Meyer & Michael A. McRobbie - 1982 - Australasian Journal of Philosophy 60 (3):265 – 281.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Valuational semantics of rule derivability.Lloyd Humberstone - 1996 - Journal of Philosophical Logic 25 (5):451 - 461.
    If a certain semantic relation (which we call 'local consequence') is allowed to guide expectations about which rules are derivable from other rules, these expectations will not always be fulfilled, as we illustrate. An alternative semantic criterion (based on a relation we call 'global consequence'), suggested by work of J.W. Garson, turns out to provide a much better - indeed a perfectly accurate - guide to derivability.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Refutation systems in modal logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
    Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Structural Reflexivity and the Paradoxes of Self-Reference.Rohan French - 2016 - Ergo: An Open Access Journal of Philosophy 3.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Non-classical Elegance for Sequent Calculus Enthusiasts.Andreas Fjellstad - 2017 - Studia Logica 105 (1):93-119.
    In this paper we develop what we can describe as a “dual two-sided” cut-free sequent calculus system for the non-classical logics of truth lp, k3, stt and a non-reflexive logic ts which is, arguably, more elegant than the three-sided sequent calculus developed by Ripley for the same logics. Its elegance stems from how it employs more or less the standard sequent calculus rules for the various connectives and truth, and the fact that it offers a rather neat connection between derivable (...)
    Download  
     
    Export citation  
     
    Bookmark   17 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   156 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   125 citations  
  • Higher-level Inferences in the Strong-Kleene Setting: A Proof-theoretic Approach.Pablo Cobreros, Elio La Rosa & Luca Tranchini - 2021 - Journal of Philosophical Logic 51 (6):1417-1452.
    Building on early work by Girard ( 1987 ) and using closely related techniques from the proof theory of many-valued logics, we propose a sequent calculus capturing a hierarchy of notions of satisfaction based on the Strong Kleene matrices introduced by Barrio et al. (Journal of Philosophical Logic 49:93–120, 2020 ) and others. The calculus allows one to establish and generalize in a very natural manner several recent results, such as the coincidence of some of these notions with their classical (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (I can’t get no) antisatisfaction.Pablo Cobreros, Elio La Rosa & Luca Tranchini - 2020 - Synthese 198 (9):8251-8265.
    Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named ST and TS, along with two structural cousins, LP and K3. It is well known that LP and K3 are duals in the sense that an inference is valid in one logic just in case the contrapositive is valid in the other logic. As a consequence of this duality, theories based on either logic are (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Multiple-conclusion lp and default classicality.Jc Beall - 2011 - Review of Symbolic Logic 4 (2):326-336.
    Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of . With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Lp+, k3+, fde+, and their 'classical collapse'.Jc Beall - 2013 - Review of Symbolic Logic 6 (4):742-754.
    This paper is a sequel to Beall (2011), in which I both give and discuss the philosophical import of a result for the propositional (multiple-conclusion) logic LP+. Feedback on such ideas prompted a spelling out of the first-order case. My aim in this paper is to do just that: namely, explicitly record the first-order result(s), including the collapse results for K3+ and FDE+.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Substructural logics, pluralism and collapse.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2018 - Synthese 198 (Suppl 20):4991-5007.
    When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...)
    Download  
     
    Export citation  
     
    Bookmark   12 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  
  • What is a Paraconsistent Logic?Damian Szmuc, Federico Pailos & Eduardo Barrio - 2018 - In Walter Carnielli & Jacek Malinowski (eds.), Contradictions, from Consistency to Inconsistency. Cham, Switzerland: Springer.
    Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Truth and Falsehood: An Inquiry Into Generalized Logical Values.Yaroslav Shramko & Heinrich Wansing - 2011 - Dordrecht, Netherland: Springer.
    The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Q-consequence operation.Grzegorz Malinowski - 1990 - Reports on Mathematical Logic 24 (1):49--59.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Formalization of a plausible inference.Szymon Frankowski - 2004 - Bulletin of the Section of Logic 33 (1):41--52.
    Download  
     
    Export citation  
     
    Bookmark   50 citations