Related categories

233 found
Order:
1 — 50 / 233
  1. Paradoxes of Logical Equivalence and Identity.Andrew Bacon - 2013 - Topoi (1):1-10.
    In this paper a principle of substitutivity of logical equivalents salve veritate and a version of Leibniz’s law are formulated and each is shown to cause problems when combined with naive truth theories.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2. Cut Elimination for Systems of Transparent Truth with Restricted Initial Sequents.Carlo Nicolai - manuscript
    The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, we (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. Systems for Non-Reflexive Consequence.Carlo Nicolai & Lorenzo Rossi - manuscript
    Substructural logics and their application to logical and semantic paradoxes have been extensively studied, but non-reflexive systems have been somewhat neglected. Here, we aim to fill this lacuna, at least in part, by presenting a non-reflexive logic and theory of naive consequence (and truth). We also investigate the semantics and the proof-theory of the system. Finally, we develop a compositional theory of truth (and consequence) in our non-reflexive framework.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Models for Substructural Arithmetics.Greg Restall - manuscript
    This paper explores models for arithmetic in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C , R and CK . The eventual goal is to find negation complete models for arithmetic in R.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  5. Depth Relevance and Hyperformalism.Shay Allen Logan - forthcoming - Journal of Philosophical Logic:1-17.
    Formal symptoms of relevance usually concern the propositional variables shared between the antecedent and the consequent of provable conditionals. Among the most famous results about such symptoms are Belnap's early results showing that for sublogics of the strong relevant logic R, provable conditionals share a signed variable between antecedent and consequent. -/- For logics weaker than R stronger variable sharing results are available. In 1984, Ross Brady gave one well-known example of such a result. As a corollary to the main (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6. Substructural Logics.Greg Restall - forthcoming - Stanford Encyclopedia of Philosophy.
    summary of work in relevant in the Anderson– tradition.]; Mares Troestra, Anne, 1992, Lectures on , CSLI Publications [A quick, easy-to.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7. Dynamic Consequence for Soft Information.Olivier Roy & Ole Thomassen Hjortland - forthcoming - Journal of Logic and Computation.
  8. Confused Entailment.Tore Fjetland Øgaard - 2022 - Topoi 41 (1):207-219.
    Priest argued in Fusion and Confusion (Priest in Topoi 34(1):55–61, 2015a) for a new concept of logical consequence over the relevant logic B, one where premises my be “confused” together. This paper develops Priest’s idea. Whereas Priest uses a substructural proof calculus, this paper provides a Hilbert proof calculus for it. Using this it is shown that Priest’s consequence relation is weaker than the standard Hilbert consequence relation for B, but strictly stronger than Anderson and Belnap’s original relevant notion of (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  9. Theorems of Alternatives for Substructural Logics.Almudena Colacito, Nikolaos Galatos & George Metcalfe - 2021 - In Ofer Arieli & Anna Zamansky (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Springer Verlag. pp. 91-105.
    A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative formulas in the “R-mingle” logic RM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {RM}$$\end{document} to the validity of a linear combination of these formulas, and Gordan’s theorem for solutions of linear systems over the real numbers that yields an analogous reduction for validity (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  10. A Family of Strict/Tolerant Logics.Melvin Fitting - 2021 - Journal of Philosophical Logic 50 (2):363-394.
    Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  11. Strong Depth Relevance.Shay Logan - 2021 - Australasian Journal of Logic 18 (6):645-656.
    Relevant logics infamously have the property that they only validate a conditional when some propositional variable is shared between its antecedent and consequent. This property has been strengthened in a variety of ways over the last half-century. Two of the more famous of these strengthenings are the strong variable sharing property and the depth relevance property. In this paper I demonstrate that an appropriate class of relevant logics has a property that might naturally be characterized as the supremum of these (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12. Hyperdoctrines and the Ontology of Stratified Semantics.Shay Logan - 2021 - In Davide Fazio, Antonio Ledda & Francesco Paoli (eds.), Algebraic Perspectives on Substructural Logics. Springer International Publishing. pp. 169-193.
    I present a version of Kit Fine's stratified semantics for the logic RWQ and define a natural family of related structures called RW hyperdoctrines. After proving that RWQ is sound with respect to RW hyperdoctrines, we show how to construct, for each stratified model, a hyperdoctrine that verifies precisely the same sentences. Completeness of RWQ for hyperdoctrinal semantics then follows from completeness for stratified semantics, which is proved in an appendix. By examining the base category of RW hyperdoctrines, we find (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  13. On Not Saying What We Shouldn't Have to Say.Shay Logan & Leach-Krouse Graham - 2021 - Australasian Journal of Logic 18 (5):524-568.
    In this paper we introduce a novel way of building arithmetics whose background logic is R. The purpose of doing this is to point in the direction of a novel family of systems that could be candidates for being the infamous R#1/2 that Meyer suggested we look for.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14. Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi.Ariel Jonathan Roffé & Federico Pailos - 2021 - Australasian Journal of Logic 3.
    In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. An Incompleteness Theorem for Modal Relevant Logics.Shawn Standefer - 2021 - Notre Dame Journal of Formal Logic 62 (4):669 - 681.
    In this paper, an incompleteness theorem for modal extensions of relevant logics is proved. The proof uses elementary methods and builds upon the work of Fuhrmann.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16. The (Greatest) Fragment of Classical Logic That Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework).Damian E. Szmuc - 2021 - Bulletin of the Section of Logic 50 (4):421-453.
    We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17. From Hilbert Proofs to Consecutions and Back.Tore Fjetland Øgaard - 2021 - Australasian Journal of Logic 18 (2):51-72.
    Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown how to extend the calculus (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18. A Recovery Operator for Nontransitive Approaches.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Review of Symbolic Logic 13 (1):80-104.
    In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  19. 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 (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   25 citations  
  20. (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 (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  21. Metainferential Duality.Bruno Da Ré, Federico Pailos, Damian Szmuc & Paula Teijeiro - 2020 - Journal of Applied Non-Classical Logics 30 (4):312-334.
    The aim of this article is to discuss the extent to which certain substructural logics are related through the phenomenon of duality. Roughly speaking, metainferences are inferences between collect...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22. Algebraic Perspectives on Substructural Logics.Davide Fazio, Antonio Ledda & Francesco Paoli (eds.) - 2020 - Springer International Publishing.
    This volume presents the state of the art in the algebraic investigation into substructural logics. It features papers from the workshop AsubL (Algebra & Substructural Logics - Take 6). Held at the University of Cagliari, Italy, this event is part of the framework of the Horizon 2020 Project SYSMICS: SYntax meets Semantics: Methods, Interactions, and Connections in Substructural logics. -/- Substructural logics are usually formulated as Gentzen systems that lack one or more structural rules. They have been intensively studied over (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. Expressing Validity: Towards a Self-Sufficient Inferentialism.Ulf Hlobil - 2020 - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2019. London: College Publications. pp. 67-82.
    For semantic inferentialists, the basic semantic concept is validity. An inferentialist theory of meaning should offer an account of the meaning of "valid." If one tries to add a validity predicate to one's object language, however, one runs into problems like the v-Curry paradox. In previous work, I presented a validity predicate for a non-transitive logic that can adequately capture its own meta-inferences. Unfortunately, in that system, one cannot show of any inference that it is invalid. Here I extend the (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Putting the Stars in Their Places.Shay Allen Logan - 2020 - Thought: A Journal of Philosophy 9 (3):188-197.
    This paper presents a new semantics for the weak relevant logic DW that makes the role of the infamous Routley star more explicable. Central to this rewriting is combining aspects of both the American and Australian plan for understanding negations in relevance logics.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Varieties of de Morgan Monoids: Covers of Atoms.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Review of Symbolic Logic 13 (2):338-374.
    The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26. Non-contractability and Revenge.Julien Murzi & Lorenzo Rossi - 2020 - Erkenntnis 85 (4):905-917.
    It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  27. (Meta)Inferential Levels of Entailment Beyond the Tarskian Paradigm.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2019 - Synthese 198 (S22):5265-5289.
    In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28. Graham Priest on Dialetheism and Paraconsistency.Can Başkent & Thomas Macaulay Ferguson (eds.) - 2019 - Cham, Switzerland: Springer Verlag.
    This book presents the state of the art in the fields of formal logic pioneered by Graham Priest. It includes advanced technical work on the model and proof theories of paraconsistent logic, in contributions from top scholars in the field. Graham Priest’s research has had a considerable influence on the field of philosophical logic, especially with respect to the themes of dialetheism—the thesis that there exist true but inconsistent sentences—and paraconsistency—an account of deduction in which contradictory premises do not entail (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30. Faithfulness for Naive Validity.Ulf Hlobil - 2019 - Synthese 196 (11):4759-4774.
    Nontransitive responses to the validity Curry paradox face a dilemma that was recently formulated by Barrio, Rosenblatt and Tajer. It seems that, in the nontransitive logic ST enriched with a validity predicate, either you cannot prove that all derivable metarules preserve validity, or you can prove that instances of Cut that are not admissible in the logic preserve validity. I respond on behalf of the nontransitive approach. The paper argues, first, that we should reject the detachment principle for naive validity. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  31. Notes on Stratified Semantics.Shay Logan - 2019 - Journal of Philosophical Logic 48 (4):749-786.
    In 1988, Kit Fine published a semantic theory for quantified relevant logics. He referred to this theory as stratified semantics. While it has received some attention in the literature, 1–20, 1992; Mares & Goldblatt, Journal of Symbolic Logic 71, 163–187, 2006), stratified semantics has overall received much less attention than it deserves. There are two plausible reasons for this. First, the only two dedicated treatments of stratified semantics available are, 27–59, 1988; Mares, Studia Logica 51, 1–20, 1992), both of which (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32. On Elimination of Quantifiers in Some Non-Classical Mathematical Theories.Guillermo Badia & Andrew Tedder - 2018 - Mathematical Logic Quarterly 64 (3):140-154.
    Elimination of quantifiers is shown to fail dramatically for a group of well‐known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by moving to more extensional underlying logics can we get the property back.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  33. 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 (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  34. Infinitary Contraction‐Free Revenge.Andreas Fjellstad - 2018 - Thought: A Journal of Philosophy 7 (3):179-189.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  35. The Cut‐Free Approach and the Admissibility‐Curry.Ulf Hlobil - 2018 - Thought: A Journal of Philosophy 7 (1):40-48.
    The perhaps most important criticism of the nontransitive approach to semantic paradoxes is that it cannot truthfully express exactly which metarules preserve validity. I argue that this criticism overlooks that the admissibility of metarules cannot be expressed in any logic that allows us to formulate validity-Curry sentences and that is formulated in a classical metalanguage. Hence, the criticism applies to all approaches that do their metatheory in classical logic. If we do the metatheory of nontransitive logics in a nontransitive logic, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  36. Choosing Your Nonmonotonic Logic: A Shopper’s Guide.Ulf Hlobil - 2018 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2017. London: College Publications. pp. 109-123.
    The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. What is a Paraconsistent Logic?Damian Szmuc, Federico Pailos & Eduardo Barrio - 2018 - In Jacek Malinowski & Walter Carnielli (eds.), Contradictions, from Consistency to Inconsistency. Springer Verlag.
    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 (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  38. Ритуально-міфологічний субстрат у романі Ґ. Майрінка «Ґолем».Larysa Yatchenko - 2018 - NaUKMA Researh Papers. Literary Studies 1:143-147.
  39. Disarming a Paradox of Validity.Hartry Field - 2017 - Notre Dame Journal of Formal Logic 58 (1):1-19.
    Any theory of truth must find a way around Curry’s paradox, and there are well-known ways to do so. This paper concerns an apparently analogous paradox, about validity rather than truth, which JC Beall and Julien Murzi call the v-Curry. They argue that there are reasons to want a common solution to it and the standard Curry paradox, and that this rules out the solutions to the latter offered by most “naive truth theorists.” To this end they recommend a radical (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  40. Prospects for a Naive Theory of Classes.Hartry Field, Harvey Lederman & Tore Fjetland Øgaard - 2017 - Notre Dame Journal of Formal Logic 58 (4):461-506.
    The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  41. When Structural Principles Hold Merely Locally.Ulf Hlobil - 2017 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2016. London: College Publications. pp. 53-67.
    In substructural logics, structural principles may hold in some fragments of a consequence relation without holding globally. I look at this phenomenon in my preferred substructural logic, in which Weakening and Cut fail but which is supra-intuitionistic. I introduce object language operators that keep track of the admissibility of Weakening and of intuitionistic implications. I end with some ideas about local transitivity.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42. Naïve Validity.Julien Murzi & Lorenzo Rossi - 2017 - Synthese 199 (Suppl 3):819-841.
    Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43. Judgement Aggregation in Non-Classical Logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.
    This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics that (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. LP, K3, and FDE as Substructural Logics.Lionel Shapiro - 2017 - In Pavel Arazim & Tomáš Lavička (eds.), The Logica Yearbook 2016. London: College Publications.
    Building on recent work, I present sequent systems for the non-classical logics LP, K3, and FDE with two main virtues. First, derivations closely resemble those in standard Gentzen-style systems. Second, the systems can be obtained by reformulating a classical system using nonstandard sequent structure and simply removing certain structural rules (relatives of exchange and contraction). I clarify two senses in which these logics count as “substructural.”.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  45. Curry's Paradox.Lionel Shapiro & Jc Beall - 2017 - Edward N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy. CSLI Publications.
    “Curry’s paradox”, as the term is used by philosophers today, refers to a wide variety of paradoxes of self-reference or circularity that trace their modern ancestry to Curry (1942b) and Löb (1955). The common characteristic of these so-called Curry paradoxes is the way they exploit a notion of implication, entailment or consequence, either in the form of a connective or in the form of a predicate. Curry’s paradox arises in a number of different domains. Like Russell’s paradox, it can take (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. A Lindström-Style Theorem for Finitary Propositional Weak Entailment Languages with Absurdity.Guillermo Badia - 2016 - Logic Journal of the IGPL 24 (2):115-137.
    Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having the finite occurrence property, preservation under relevant directed bisimulations and the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  47. The Relevant Fragment of First Order Logic.Guillermo Badia - 2016 - Review of Symbolic Logic 9 (1):143-166.
    Under a proper translation, the languages of propositional (and quantified relevant logic) with an absurdity constant are characterized as the fragments of first order logic preserved under (world-object) relevant directed bisimulations. Furthermore, the properties of pointed models axiomatizable by sets of propositional relevant formulas have a purely algebraic characterization. Finally, a form of the interpolation property holds for the relevant fragment of first order logic.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48. Is Multiset Consequence Trivial?Petr Cintula & Francesco Paoli - 2016 - Synthese 199 (Suppl 3):741-765.
    Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  49. A Nonmonotonic Sequent Calculus for Inferentialist Expressivists.Ulf Hlobil - 2016 - In Pavel Arazim & Michal Dančák (eds.), The Logica Yearbook 2015. College Publications. pp. 87-105.
    I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity fails, but (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  50. A Note on the Substructural Hierarchy.Emil Jeřábek - 2016 - Mathematical Logic Quarterly 62 (1-2):102-110.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 233