Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Dag Prawitz on Proofs and Meaning.Heinrich Wansing (ed.) - 2014 - Cham, Switzerland: Springer.
    This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Logics for modelling collective attitudes.Daniele Porello - 2018 - Fundamenta Informaticae 158 (1-3):239-27.
    We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by means of minimal modalities (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Nikolaos Galatos.Hiroakira Ono - 2006 - Studia Logica 83 (1-3):1-32.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sentence connectives in formal logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • What is relevance logic?Arnon Avron - 2014 - Annals of Pure and Applied Logic 165 (1):26-48.
    We suggest two precise abstract definitions of the notion of ‘relevance logic’ which are both independent of any proof system or semantics. We show that according to the simpler one, R → source is the minimal relevance logic, but R itself is not. In contrast, R and many other logics are relevance logics according to the second definition, while all fragments of linear logic are not.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Modal translations in substructural logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.
    Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Non-reflexive Nonsense: Proof-Theory for Paracomplete Weak Kleene Logic.Bruno Da Ré, Damian Szmuc & María Inés Corbalán - forthcoming - Studia Logica:1-17.
    Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Variations on intra-theoretical logical pluralism: internal versus external consequence.Bogdan Dicher - 2020 - Philosophical Studies 177 (3):667-686.
    Intra-theoretical logical pluralism is a form of meaning-invariant pluralism about logic, articulated recently by Hjortland :355–373, 2013). This version of pluralism relies on it being possible to define several distinct notions of provability relative to the same logical calculus. The present paper picks up and explores this theme: How can a single logical calculus express several different consequence relations? The main hypothesis articulated here is that the divide between the internal and external consequence relations in Gentzen systems generates a form (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The Logics of Strict-Tolerant Logic.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - 2015 - Journal of Philosophical Logic 44 (5):551-571.
    Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this (...)
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
    Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. This accounting is made possible by removing the ‘structural’ rules of contraction and weakening, adding a modal operator and adding finer versions of the propositional connectives. Linear logic has fundamental logical interest and applications to computer science, particularly to Petri nets, concurrency, storage allocation, garbage collection and the control structure of logic programs. In addition, there is a direct correspondence between polynomial-time computation (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Logical Consequence and the Paradoxes.Edwin Mares & Francesco Paoli - 2014 - Journal of Philosophical Logic 43 (2-3):439-469.
    We group the existing variants of the familiar set-theoretical and truth-theoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of logical constants, and the latter to an equivocation over the notion of consequence. Both equivocation sources are tightly related, (...)
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Linear logic displayed.Nuel Belnap - 1989 - Notre Dame Journal of Formal Logic 31 (1):14-25.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)The original sin of proof-theoretic semantics.Francesco Paoli & Bogdan Dicher - 2018 - Synthese 198 (1):615-640.
    Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...)
    Download  
     
    Export citation  
     
    Bookmark   13 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   13 citations  
  • ★-autonomous Lattices.Francesco Paoli - 2005 - Studia Logica 79 (2):283-304.
    -autonomous lattices are the algebraic exponentials and without additive constants. In this paper, we investigate the structure theory of this variety and some of its subvarieties, as well as its relationships with other classes of algebras.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Current Trends in Substructural Logics.Katalin Bimbó - 2015 - Journal of Philosophical Logic 44 (6):609-624.
    This paper briefly overviews some of the results and research directions. In the area of substructural logics from the last couple of decades. Substructural logics are understood here to include relevance logics, linear logic, variants of Lambek calculi and some other logics that are motivated by the idea of omitting some structural rules or making other structural changes in LK, the original sequent calculus for classical logic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorial Grammar and Type Theory.Johan Van Benthem - 1990 - Journal of Philosophical Logic 19 (2):115-168.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • External Curries.Heinrich Wansing & Graham Priest - 2015 - Journal of Philosophical Logic 44 (4):453-471.
    Curry’s paradox is well known. The original version employed a conditional connective, and is not forthcoming if the conditional does not satisfy contraction. A newer version uses a validity predicate, instead of a conditional, and is not forthcoming if validity does not satisfy structural contraction. But there is a variation of the paradox which uses “external validity”. And since external validity contracts, one might expect the appropriate version of the Curry paradox to be inescapable. In this paper we show that (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On the infinite-valued Łukasiewicz logic that preserves degrees of truth.Josep Maria Font, Àngel J. Gil, Antoni Torrens & Ventura Verdú - 2006 - Archive for Mathematical Logic 45 (7):839-868.
    Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)The original sin of proof-theoretic semantics.Bogdan Dicher & Francesco Paoli - 2020 - Synthese:1-26.
    Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A linear conservative extension of zermelo-Fraenkel set theory.Masaru Shirahata - 1996 - Studia Logica 56 (3):361 - 392.
    In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF– i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF–. This implies that LZF is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Grafting modalities onto substructural implication systems.Marcello D'agostino, Dov M. Gabbay & Alessandra Russo - 1997 - Studia Logica 59 (1):65-102.
    We investigate the semantics of the logical systems obtained by introducing the modalities and into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we "import" this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled refutation system for the new logics which is a natural extension of a system for substructural implication developed by the first two authors in (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A cut-free modal theory of consequence.Edson Bezerra - 2025 - Asian Journal of Philosophy 4 (1):1-21.
    The cut-free validity theory $$\textsf{STV}$$ proposed by Barrio, Rosenblatt, and Tajer suffers from incompleteness with respect to its object language validity predicate. The validity predicate of $$\textsf{STV}$$ fails in validating some valid inferences of its underlying logic, the Strict Tolerant logic $$\textsf{ST}$$. In this paper, we will present the non-normal modal logic $$\textsf{ST}^{\Box \Diamond }$$ whose modalities $$\Box $$ and $$\Diamond $$ capture the tautologies/valid inferences and the consistent formulas of the logic $$\textsf{ST}$$, respectively. We show that $$\textsf{ST}^{\Box \Diamond }$$ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Inferences and Metainferences in ST.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2020 - Journal of Philosophical Logic 49 (6):1057-1077.
    In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Rule Separation and Embedding Theorems for Logics Without Weakening.Clint J. van Alten & James G. Raftery - 2004 - Studia Logica 76 (2):241-274.
    A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Order algebraizable logics.James G. Raftery - 2013 - Annals of Pure and Applied Logic 164 (3):251-283.
    This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Studia Logica 83 (1-3):279-308.
    Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Type Logical Grammar: Categorial Logic of Signs.G. V. Morrill - 2012 - Dordrecht, Netherland: Springer Verlag.
    This book sets out the foundations, methodology, and practice of a formal framework for the description of language. The approach embraces the trends of lexicalism and compositional semantics in computational linguistics, and theoretical linguistics more broadly, by developing categorial grammar into a powerful and extendable logic of signs. Taking Montague Grammar as its point of departure, the book explains how integration of methods from philosophy (logical semantics), computer science (type theory), linguistics (categorial grammar) and meta-mathematics (mathematical logic ) provides a (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Contextual Deduction Theorems.J. G. Raftery - 2011 - Studia Logica 99 (1-3):279-319.
    Logics that do not have a deduction-detachment theorem (briefly, a DDT) may still possess a contextual DDT —a syntactic notion introduced here for arbitrary deductive systems, along with a local variant. Substructural logics without sentential constants are natural witnesses to these phenomena. In the presence of a contextual DDT, we can still upgrade many weak completeness results to strong ones, e.g., the finite model property implies the strong finite model property. It turns out that a finitary system has a contextual (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Linear logic.Roberto Di Cosmo & Dale Miller - unknown - Stanford Encyclopedia of Philosophy.
    , from Stanford Encyclopaedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.
    In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Paraconsistent quantum logics.Maria Luisa Dalla Chiara & Roberto Giuntini - 1989 - Foundations of Physics 19 (7):891-904.
    Paraconsistent quantum logics are weak forms of quantum logic, where the noncontradiction and the excluded-middle laws are violated. These logics find interesting applications in the operational approach to quantum mechanics. In this paper, we present an axiomatization, a Kripke-style, and an algebraic semantical characterization for two forms of paraconsistent quantum logic. Further developments are contained in Giuntini and Greuling's paper in this issue.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Dialogues as a dynamic framework for logic.Helge Rückert - unknown
    Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the Proponent’s thesis, alternately utter argumentative moves according to certain rules. For a long time the dialogical approach had been worked out only for classical and intuitionistic logic. The seven papers of this dissertation (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Deep ST.Thomas M. Ferguson & Elisángela Ramírez-Cámara - 2021 - Journal of Philosophical Logic 51 (6):1261-1293.
    Many analyses of notion of _metainferences_ in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e._, inferences involving objects belonging (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Natural Deduction Bottom Up.Ernst Zimmermann - 2021 - Journal of Logic, Language and Information 30 (3):601-631.
    The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive disjunction, multiplicative conjunction, existence quantifier and possibility modality. Elimination rules by composition have an enormous impact on proof-structures of deductions: they do not produce segments, deduction trees remain binary branching, there is no vacuous discharge, there is only few need of permutations. This new (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof‐theoretic semantics of natural deduction based on inversion.Ernst Zimmermann - 2021 - Theoria 87 (6):1651-1670.
    The article presents a full proof‐theoretic semantics for natural deduction based on an extended inversion principle: the elimination rule for an operator q may invert the introduction rule for q, but also vice versa, the introduction rule for a connective q may invert the elimination rule for q. Such an inversion—extending Prawitz' concept of inversion—gives the following theorem: Inversion for two rules of operator q (intro rule, elim rule) exists iff a reduction of a maximum formula for q exists. The (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Informational interpretation of substructural propositional logics.Heinrich Wansing - 1993 - Journal of Logic, Language and Information 2 (4):285-308.
    This paper deals with various substructural propositional logics, in particular with substructural subsystems of Nelson's constructive propositional logics N– and N. Doen's groupoid semantics is extended to these constructive systems and is provided with an informational interpretation in terms of information pieces and operations on information pieces.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Investigations into a left-structural right-substructural sequent calculus.Lloyd Humberstone - 2007 - Journal of Logic, Language and Information 16 (2):141-171.
    We study a multiple-succedent sequent calculus with both of the structural rules Left Weakening and Left Contraction but neither of their counterparts on the right, for possible application to the treatment of multiplicative disjunction against the background of intuitionistic logic. We find that, as Hirokawa dramatically showed in a 1996 paper with respect to the rules for implication, the rules for this connective render derivable some new structural rules, even though, unlike the rules for implication, these rules are what we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Language in action.Johan Benthem - 1991 - Journal of Philosophical Logic 20 (3):225 - 263.
    A number of general points behind the story of this paper may be worth setting out separately, now that we have come to the end.There is perhaps one obvious omission to be addressed right away. Although the word “information” has occurred throughout this paper, it must have struck the reader that we have had nothing to say on what information is. In this respect, our theories may be like those in physics: which do not explain what “energy” is (a notion (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Editorial Introduction.Francesco Paoli & Gavin St John - 2024 - Studia Logica 112 (6):1201-1214.
    This is the Editorial Introduction to “S.I.: Strong and Weak Kleene Logics”.
    Download  
     
    Export citation  
     
    Bookmark  
  • Correction to: Variations on intra-theoretical logical pluralism: internal versus external consequence.Bogdan Dicher - 2020 - Philosophical Studies 177 (3):687-687.
    In the original publication of the article, in Definition 4, the sixth line which reads as.
    Download  
     
    Export citation  
     
    Bookmark  
  • Fragments of R-Mingle.W. J. Blok & J. G. Raftery - 2004 - Studia Logica 78 (1-2):59-106.
    The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Prior’s OIC nonconservativity example revisited.Lloyd Humberstone - 2014 - Journal of Applied Non-Classical Logics 24 (3):209-235.
    In his 1964 note, ‘Two Additions to Positive Implication’, A. N. Prior showed that standard axioms governing conjunction yield a nonconservative extension of the pure implicational intermediate logic OIC of R. A. Bull. Here, after reviewing the situation with the aid of an adapted form of the Kripke semantics for intuitionistic and intermediate logics, we proceed to illuminate this example by transposing it to the setting of modal logic, and then relate it to the propositional logic of what have been (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Necessity of Thought.Cesare Cozzo - 2014 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Cham, Switzerland: Springer. pp. 101-20.
    The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations