Switch to: Citations

Add references

You must login to add references.
  1. An Introduction to Substructural Logics.Greg Restall - 1999 - New York: Routledge.
    This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...)
    Download  
     
    Export citation  
     
    Bookmark   202 citations  
  • A mathematical introduction to logic.Herbert Bruce Enderton - 1972 - New York,: Academic Press.
    A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...)
    Download  
     
    Export citation  
     
    Bookmark   123 citations  
  • Tonk, Plonk and Plink.Nuel Belnap - 1962 - Analysis 22 (6):130-134.
    Download  
     
    Export citation  
     
    Bookmark   214 citations  
  • What is logic?Ian Hacking - 1979 - Journal of Philosophy 76 (6):285-319.
    Download  
     
    Export citation  
     
    Bookmark   130 citations  
  • Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
    A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.
    Download  
     
    Export citation  
     
    Bookmark   106 citations  
  • Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
    Download  
     
    Export citation  
     
    Bookmark   118 citations  
  • A formalization of the propositional calculus of H-B logic.Cecylia Rauszer - 1974 - Studia Logica 33 (1):23 - 34.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Implicational paradoxes and the meaning of logical constants.Francesco Paoli - 2007 - Australasian Journal of Philosophy 85 (4):553 – 579.
    I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to select as a plausible candidate LL, a fragment of linear logic that differs from R in that it rejects both contraction and distribution.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • A cut-free sequent system for two-dimensional modal logic, and why it matters.Greg Restall - 2012 - Annals of Pure and Applied Logic 163 (11):1611-1623.
    The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Constructive negation, implication, and co-implication.Heinrich Wansing - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):341-364.
    In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • A constructive analysis of RM.Arnon Avron - 1987 - Journal of Symbolic Logic 52 (4):939 - 951.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Intuitionistic fuzzy logic and intuitionistic fuzzy set theory.Gaisi Takeuti & Satoko Titani - 1984 - Journal of Symbolic Logic 49 (3):851-866.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Substructural Fuzzy Logics.George Metcalfe & Franco Montagna - 2007 - Journal of Symbolic Logic 72 (3):834 - 864.
    Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0.1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) ∨ ((B → A) ∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MTL and Gödel logic G, and new weakening-free logics. Algebraic semantics for these logics are (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Cut-free sequent calculi for some tense logics.Ryo Kashima - 1994 - Studia Logica 53 (1):119 - 135.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
    Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In this paper, a Gentzen-style framework is introduced for analytic proof systems that derive admissible rules of non-classical logics. While Gentzen systems for derivability treat sequents as basic objects, for admissibility, the basic objects are sequent rules. Proof systems are defined here for admissible rules of classes of modal logics, including K4, S4, and GL, and also Intuitionistic Logic IPC. With minor (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Quantifiers as modal operators.Steven T. Kuhn - 1980 - Studia Logica 39 (2-3):145 - 158.
    Montague, Prior, von Wright and others drew attention to resemblances between modal operators and quantifiers. In this paper we show that classical quantifiers can, in fact, be regarded as S5-like operators in a purely propositional modal logic. This logic is axiomatized and some interesting fragments of it are investigated.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Algorithmic correspondence and canonicity for distributive modal logic.Willem Conradie & Alessandra Palmigiano - 2012 - Annals of Pure and Applied Logic 163 (3):338-376.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • On logics with coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
    This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
    In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Labeled calculi and finite-valued logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
    A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A Mathematical Introduction to Logic.Herbert Enderton - 2001 - Bulletin of Symbolic Logic 9 (3):406-407.
    Download  
     
    Export citation  
     
    Bookmark   194 citations  
  • Displaying and deciding substructural logics 1: Logics with contraposition.Greg Restall - 1998 - Journal of Philosophical Logic 27 (2):179-216.
    Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic. However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Modal Foundations for Predicate Logic.Johan van Benthem - 1997 - Logic Journal of the IGPL 5 (2):259-286.
    The complexity of any logical modeling reflects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigate ‘lighter’ versions of this general purpose tool, by modally ‘deconstructing’ the usual semantics, and locating implicit choice points in its set up. The first part sets out the interest of this program and the modal (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (1 other version)A Cut‐Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Mathematical Logic Quarterly 35 (4):289-301.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Translation of hypersequents into display sequents.H. Wansing - 1998 - Logic Journal of the IGPL 6 (5):719-734.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Predicate logics on display.Heinrich Wansing - 1999 - Studia Logica 62 (1):49-75.
    The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)A Cut-Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):289-301.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Analytic Calculi for Product Logics.George Metcalfe, Nicola Olivetti & Dov Gabbay - 2004 - Archive for Mathematical Logic 43 (7):859-889.
    Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Bunched Logics Displayed.James Brotherston - 2012 - Studia Logica 100 (6):1223-1254.
    We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations. We show how to constrain applications of display-equivalence in our calculi in such a way that an exhaustive proof search need be only finitely branching, and establish a full deduction theorem for the bunched logics with classical additives, BBI and CBI. We (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A proof-theoretical investigation of global intuitionistic (fuzzy) logic.Agata Ciabattoni - 2005 - Archive for Mathematical Logic 44 (4):435-457.
    We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced by Takeuti and Titani to formulate an intuitionistic set theory and an intuitionistic fuzzy set theory together with their metatheories. Here we define analytic Gentzen style calculi for GI and GIF. Among other things, these calculi allows one to prove Herbrand’s theorem for suitable fragments of GI and GIF.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Classical modal display logic in the calculus of structures and minimal cut-free deep inference calculi for S.Rajeev Gore - manuscript
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Substructural logics on display.R. Goré - 1998 - Logic Journal of the IGPL 6 (3):451-504.
    Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponential-free linear logic, relevant logic, BCK logic, and intuitionistic logic, in an incremental way. Each of these logics also has a classical counterpart, and some also (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations