Related categories

1 found
Order:
  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   3 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-reexive systems have been somewhat neglected. Here, we aim to (at least partly) ll this lacuna, by presenting a non-reexive logic and theory of naïve 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-reexive framework.
    Remove from this list  
     
    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. (Meta)Inferential Levels of Entailment Beyond the Tarskian Paradigm.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - forthcoming - Synthese:1-25.
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  6. Substructural Logics, Pluralism and Collapse.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - forthcoming - Synthese:1-17.
    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   2 citations  
  7. Is Multiset Consequence Trivial?Petr Cintula & Francesco Paoli - forthcoming - Synthese:1-25.
    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 (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8. (I Can't Get No) Antisatisfaction.Pablo Cobreros, Elio La Rosa & Luca Tranchini - forthcoming - Synthese:1-15.
    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)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  9. Naïve Validity.Julien Murzi & Lorenzo Rossi - forthcoming - Synthese:1-23.
    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 (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10. 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  
  11. Dynamic Consequence for Soft Information.Olivier Roy & Ole Thomassen Hjortland - forthcoming - Journal of Logic and Computation.
  12. The Very Idea of a Substructural Approach to Paradox.Lionel Shapiro - forthcoming - Synthese:1-20.
    This paper aims to call into question the customary division of logically revisionary responses to the truth-theoretic paradoxes into those that are “substructural” and those that are “ structural.” I proceed by examining, as a case study, Beall’s recent proposal based on the paraconsistent logic LP. Beall formulates his response to paradox in terms of a consequence relation that obeys all standard structural rules, though at the price of the language’s lacking a detaching conditional. I argue that the same response (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  13. The (Greatest) Fragment of Classical Logic That Respects the Variable-Sharing Principle (in the Fmla-Fmla Framework).Damian Szmuc - forthcoming - Bulletin of the Section of Logic.
    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  
     
    Export citation  
     
    Bookmark  
  14. On Closure and Truth in Substructural Theories of Truth.Zach Weber - forthcoming - Synthese:1-15.
    Closure is the idea that what is true about a theory of truth should be true in it. Commitment to closure under truth motivates non-classical logic; commitment to closure under validity leads to substructural logic. These moves can be thought of as responses to revenge problems. With a focus on truth in mathematics, I will consider whether a noncontractive approach faces a similar revenge problem with respect to closure under provability, and argue that if a noncontractive theory is to be (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. 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 (2 more)  
     
    Export citation  
     
    Bookmark  
  16. 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   10 citations  
  17. 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   3 citations  
  18. 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  
  19. 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  
  20. 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 (6 more)  
     
    Export citation  
     
    Bookmark  
  21. 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   1 citation  
  22. 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  
  23. Graham Priest on Dialetheism and Paraconsistency.Can Başkent & Thomas Macaulay Ferguson (eds.) - 2019 - Springer Verlag.
  24. Negation on the Australian Plan.Francesco Berto & Greg Restall - 2019 - Journal of Philosophical Logic 48 (6):1119-1144.
    We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities between such points. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  25. 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  
  26. Logical Revision by Counterexamples: A Case Study of the Paraconsistent Counterexample to Ex Contradictione Quodlibet.Seungrak Choi - 2019 - In Proceedings of the 14th and 15th Asian Logic Conferences. pp. 141-167.
    It is often said that a correct logical system should have no counterexample to its logical rules and the system must be revised if its rules have a counterexample. If a logical system (or theory) has a counterexample to its logical rules, do we have to revise the system? In this paper, focussing on the role of counterexamples to logical rules, we deal with the question. -/- We investigate two mutually exclusive theories of arithmetic - intuitionistic and paraconsistent theories. The (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  27. 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   1 citation  
  28. 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   2 citations  
  29. 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 (2 more)  
     
    Export citation  
     
    Bookmark  
  30. Infinitary Contraction‐Free Revenge.Andreas Fjellstad - 2018 - Thought: A Journal of Philosophy 7 (3):179-189.
  31. 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 (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32. 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  
  33. 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   8 citations  
  34. Ритуально-міфологічний субстрат у романі Ґ. Майрінка «Ґолем».Larysa Yatchenko - 2018 - NaUKMA Researh Papers. Literary Studies 1:143-147.
  35. 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   7 citations  
  36. 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  
  37. 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  
  38. 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 (7 more)  
     
    Export citation  
     
    Bookmark  
  39. 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   3 citations  
  40. 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   1 citation  
  41. 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   2 citations  
  42. 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  
  43. 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   3 citations  
  44. A Note on the Substructural Hierarchy.Emil Jeřábek - 2016 - Mathematical Logic Quarterly 62 (1-2):102-110.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45. On Semi-Fusions and Semi-Negations.Francez Nissim - 2016 - SOUTH AMERICAN JOURNAL OF LOGIC 2 (1):109-118.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  46. A Comparison Between Monoidal and Substructural Logics.Clayton Peterson - 2016 - Journal of Applied Non-Classical Logics 26 (2):126-159.
    Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The purpose of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Contraction and Revision.Shawn Standefer - 2016 - Australasian Journal of Logic 13 (3):58-77.
    An important question for proponents of non-contractive approaches to paradox is why contraction fails. Zardini offers an answer, namely that paradoxical sentences exhibit a kind of instability. I elaborate this idea using revision theory, and I argue that while instability does motivate failures of contraction, it equally motivates failure of many principles that non-contractive theorists want to maintain.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Qualitative Probabilistic Inference Under Varied Entropy Levels.Paul D. Thorn & Gerhard Schurz - 2016 - Journal of Applied Logic 19 (2):87-101.
    In previous work, we studied four well known systems of qualitative probabilistic inference, and presented data from computer simulations in an attempt to illustrate the performance of the systems. These simulations evaluated the four systems in terms of their tendency to license inference to accurate and informative conclusions, given incomplete information about a randomly selected probability distribution. In our earlier work, the procedure used in generating the unknown probability distribution (representing the true stochastic state of the world) tended to yield (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49. Restriction by Noncontraction.Elia Zardini - 2016 - Notre Dame Journal of Formal Logic 57 (2):287-327.
    This paper investigates how naive theories of truth fare with respect to a set of extremely plausible principles of restricted quantification. It is first shown that both nonsubstructural theories as well as certain substructural theories cannot validate all those principles. Then, pursuing further an approach to the semantic paradoxes that the author has defended elsewhere, the theory of restricted quantification available in a specific naive theory that rejects the structural property of contraction is explored. It is shown that the theory (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50. Paths to Triviality.Tore Øgaard - 2016 - Journal of Philosophical Logic 45 (3):237-276.
    This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations