An Introduction to Substructural Logics

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 students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading.

[1]  S. Lane.  Categories for the Working Mathematician , 1971 .

[2]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[3]  G. Mints,et al.  Cut-elimination theorem for relevant logics , 1976 .

[4]  Alasdair Urquhart.  Decision problems for distributive lattice-ordered semigroups , 1995 .

[5]  Abraham Robinson.  Selected papers of Abraham Robinson , 1978 .

[6]  Nuel Belnap,et al.  Linear Logic Displayed , 1989, Notre Dame J. Formal Log..

[7]  A. G. Dragálin.  Mathematical Intuitionism. Introduction to Proof Theory , 1988 .

[8]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[9]  Wendy MacCaull,et al.  A Kripke Semantics for the Logic of Gelfand Quantales , 2001, Stud Logica.

[10]  N. Cocchiarella,et al.  Situations and Attitudes. , 1986 .

[11]  Betti Venneri,et al.  Intersection Types as Logical Formulae , 1994, J. Log. Comput..

[12]  Wojciech Buszkowski.  The finite model property for BCI and related systems , 1996, Stud Logica.

[13]  Kosta Došen,et al.  Modal Translations in K and D , 1993 .

[14]  Joachim Lambek,et al.  On the Calculus of Syntactic Types , 1961 .

[15]  Robert K. Meyer,et al.  E, R AND γ , 1969, Journal of Symbolic Logic.

[16]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[17]  H. Rasiowa.  An Algebraic Approach To Non Classical Logics , 1974 .

[18]  J. Conway.  Regular algebra and finite machines , 1971 .

[19]  Nuel D. Belnap,et al.  Tonk, Plonk and Plink , 1962 .

[20]  W. V. Quine,et al.  Three Grades of Modal Involvment , 1953 .

[21]  Robert K. Meyer,et al.  The semantics ofR4 , 1993, J. Philos. Log..

[22]  John L. Bell,et al.  A New Approach to Quantum Logic , 1986, The British Journal for the Philosophy of Science.

[23]  G. Grätzer.  General Lattice Theory , 1978 .

[24]  R. Meyer,et al.  The semantics of entailment — III , 1973 .

[25]  James E. Tomberlin,et al.  On the Plurality of Worlds. , 1989 .

[26]  Stephen Read,et al.  Thinking about logic , 1994 .

[27]  Graham Priest,et al.  Simplified semantics for basic relevant logics , 1992, J. Philos. Log..

[28]  Mariangiola Dezani-Ciancaglini,et al.  Functional Characters of Solvable Terms , 1981, Math. Log. Q..

[29]  Alasdair Urquhart,et al.  The undecidability of entailment and relevant implication , 1984, Journal of Symbolic Logic.

[30]  Alasdair Urquhart,et al.  Semantics for relevant logics , 1972, Journal of Symbolic Logic.

[31]  Nuel Belnap,et al.  Linear Analytic Tableaux , 1995, TABLEAUX.

[32]  Richard Routley,et al.  Classical relevant logics II , 1973 .

[33]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[34]  Haskell B. Curry,et al.  Foundations of Mathematical Logic , 1964 .

[35]  Michael A. McRobbie,et al.  Relevant analytic tableaux , 1979 .

[36]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[37]  Nicholas Rescher,et al.  On Inferences from Inconsistent Premises , 1970 .

[38]  Edwin D. Mares,et al.  On S , 1994, Stud Logica.

[39]  J. Michael Dunn,et al.  Positive modal logic , 1995, Stud Logica.

[40]  G. Priest.  Beyond the Limits of Thought , 1997 .

[41]  Greg Restall,et al.  Deviant logic and the paradoxes of self reference , 1993 .

[42]  Newton C. A. da Costa,et al.  A semantical analysis of the calculi Cn , 1977, Notre Dame J. Formal Log..

[43]  Greg Restall.  Combining Possibilities and Negations , 1997, Stud Logica.

[44]  J. Dunn,et al.  Generalized Ortho Negation , 1996 .

[45]  Kosta Dosen,et al.  A Brief Survey of Frames for the Lambek Calculus , 1992, Math. Log. Q..

[46]  Philip Wadler,et al.  There's No Substitute for Linear Logic , 1991 .

[47]  H. M. MACNEILLEf,et al.  Partially ordered sets , 1937 .

[48]  Greg Restall,et al.  A Useful Substructural Logic , 1994, Bull. IGPL.

[49]  E. Orlowska.  Relational interpretation of modal logics , 1988 .

[50]  Richard Routley,et al.  Relevant logics and their rivals , 1982 .

[51]  Chrysafis Hartonas,et al.  Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics , 1997, Stud Logica.

[52]  Robert K. Meyer,et al.  The finite model property for BCK and BCIW , 1994, Stud Logica.

[53]  R. A. Bull,et al.  Basic Modal Logic , 1984 .

[54]  Richard Sylvan,et al.  The semantics of entailment—II , 1972, Journal of Philosophical Logic.

[55]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[56]  Kosta Dosen,et al.  The first axiomatization of relevant logic , 1992, J. Philos. Log..

[57]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[58]  Nuel Belnap,et al.  Display logic , 1982, J. Philos. Log..

[59]  Alfred Tarski,et al.  Logic, Semantics, Metamathematics: Papers from 1923 to 1938 , 1958 .

[60]  J. Dunn,et al.  The algebra of intensional logics , 2019 .

[61]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[62]  Valeria C V de Paiva,et al.  Term Assignment for Intuitionistic Linear Logic , 1992 .

[63]  Haskell B. Curry,et al.  Combinatory Logic, Volume I , 1959 .

[64]  John K. Slaney,et al.  Reduced models for relevant logics without WI , 1987, Notre Dame J. Formal Log..

[65]  Kosta Dosen,et al.  Rudimentary Kripke Models for the Intuitionistic Propositional Calculus , 1993, Ann. Pure Appl. Log..

[66]  Alasdair Urquhart,et al.  The complexity of decision procedures in relevance logic II , 1999, Journal of Symbolic Logic.

[67]  J. Dunn,et al.  Star and Perp: Two Treatments of Negation1 , 1993 .

[68]  G. Kreisel.  The Collected Papers of Gerhard Gentzen , 1971 .

[69]  Chrysafis Hartonas,et al.  Order-Duality, Negation and Lattice Representation , 1996 .

[70]  Neil Tennant,et al.  The transmission of truth and the transitivity of deduction , 1994 .

[71]  Nick Benton,et al.  A Term Calculus for Intuitionistic Linear Logic , 1993, TLCA.

[72]  Dirk Roorda,et al.  Resource Logics : Proof-Theoretical Investigations , 1991 .

[73]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[74]  Philip Wadler,et al.  A Taste of Linear Logic , 1993, MFCS.

[75]  J. Barwise,et al.  Shifting situations and shaken attitudes , 1985 .

[76]  Evert W. Beth,et al.  Semantic Entailment And Formal Derivability , 1955 .

[77]  R. Goldblatt.  Mathematics of modality , 1993 .

[78]  J. Michael Dunn,et al.  A Kripke-style semantics for R-Mingle using a binary accessibility relation , 1976 .

[79]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[80]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[81]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[82]  T. Schmidt-Kaler,et al.  An addendum to the , 2001 .

[83]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[84]  Greg Restall,et al.  Simplified semantics for relevant logics (and some of their rivals) , 1993, J. Philos. Log..

[85]  G. Priest.  In Contradiction: A Study of the Transconsistent , 1987 .

[86]  Vaughan R. Pratt,et al.  Dynamic algebras and the nature of induction , 1980, STOC '80.

[87]  Robert Goldblatt,et al.  Semantic analysis of orthologic , 1974, J. Philos. Log..

[88]  Gerard Allwein,et al.  A Kripke semantics for linear logic , 1993 .

[89]  Kosta Dosen,et al.  Logical Constants as Punctuation Marks , 1989, Notre Dame J. Formal Log..

[90]  Robert K. Meyer,et al.  The Admissibility of γ in R4 , 1992, Notre Dame J. Formal Log..

[91]  H. B. Curry,et al.  Combinatory Logic, Volume I. , 1961 .

[92]  A. Heyting,et al.  Intuitionism: An introduction , 1956 .

[93]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[94]  Robert K. Meyer,et al.  ⊃E is Admissible in “true” relevant arithmetic , 1998, J. Philos. Log..

[95]  D. Scott.  On Engendering an Illusion of Understanding , 1971 .

[96]  C. Morgan,et al.  Automated Theorem Proving in Non-Classical Logics , 1995 .

[97]  Alasdair Urquhart,et al.  Duality for algebras of relevant logics , 1996, Stud Logica.

[98]  R. Tennant.  Algebra , 1941, Nature.

[99]  Giovanni Sambin,et al.  Pretopologies and completeness proofs , 1995, Journal of Symbolic Logic.

[100]  Hiroakira Ono,et al.  Logics without the contraction rule , 1985, Journal of Symbolic Logic.

[101]  Richard Sylvan,et al.  The semantics of entailment — III , 1972, J. Philos. Log..

[102]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[103]  Giovanni Sambin.  Intuitionistic formal spaces and their neighbourhood , 1989 .

[104]  Maarten de Rijke,et al.  Simulating Without Negation , 1997, J. Log. Comput..

[105]  A. N. Prior,et al.  The Theory of Implication , 1963 .

[106]  Allén Sture,et al.  Possible Worlds and Subject Matter. Discussion of Barbara H. Partee’s paper “Possible Worlds in Model-Theoretic Semantics: A Linguistic Perspective” , 1988 .

[107]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[108]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[109]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[110]  Jean-Yves Girard,et al.  On the Unity of Logic , 1993, Ann. Pure Appl. Log..

[111]  J. Lambek.  The Mathematics of Sentence Structure , 1958 .

[112]  Stephen Cole Kleene.  Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms , 1962, J. Symb. Log..

[113]  George Gratzer,et al.  Universal Algebra , 1979 .

[114]  Michael Grüninger,et al.  Introduction , 2002, CACM.

[115]  G. Mints,et al.  Closed categories and the theory of proofs , 1981 .

[116]  Greg Restall,et al.  Display Logic and Gaggle Theory , 1995, Reports Math. Log..

[117]  William P. R. Mitchell.  The Carcinogenic Example , 1997, Log. J. IGPL.

[118]  John Slaney.  A general logic , 1990 .

[119]  G. E. Hughes,et al.  An introduction to modal logic, 2e éd., 1 vol , 1973 .

[120]  K. BenthemvanJ.F.A..  Language in Action. Categories, Lambdas and Dynamic Logic , 1991 .

[121]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[122]  Kosta Dosen,et al.  Sequent-systems and groupoid models. I , 1988, Stud Logica.

[123]  Chrysafis Hartonas,et al.  Stone duality for lattices , 1997 .

[124]  John L. Bell,et al.  Toposes and local set theories - an introduction , 1988 .

[125]  A. Robinson.  Non-standard analysis , 1966 .

[126]  Nuel D. Belnap,et al.  How a Computer Should Think , 2019, New Essays on Belnap-­Dunn Logic.

[127]  Robert K. Meyer.  RI the Bounds of Finitude , 1970 .

[128]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[129]  J. Girard.  Proof Theory and Logical Complexity , 1989 .

[130]  Newton C. A. da Costa,et al.  On the theory of inconsistent formal systems , 1974, Notre Dame J. Formal Log..

[131]  Philip Wadler,et al.  A Syntax for Linear Logic , 1993, MFPS.

[132]  Wojciech Buszkowski.  Completeness Results for Lambek Syntactic Calculus , 1986, Math. Log. Q..

[133]  Greg Restall,et al.  Truthmakers, entailment and necessity , 1996 .

[134]  Haskell B. Curry,et al.  Some Philosophical Aspects of Combinatory Logic , 1980 .

[135]  Heinrich Wansing,et al.  The Logic of Information Structures , 1993, Lecture Notes in Computer Science.

[136]  Nuel D. Belnap,et al.  Entailment and the disjunctive syllogism , 1981 .

[137]  Kit Fine,et al.  Semantics for quantified relevance logic , 1988, J. Philos. Log..

[138]  Yves Lafont.  The Finite Model Property for Various Fragments of Linear Logic , 1997, J. Symb. Log..

[139]  Greg Restall,et al.  Displaying and Deciding Substructural Logics 1: Logics with Contraposition , 1998, J. Philos. Log..

[140]  J. Michael Dunn,et al.  Gaggle Theory: An Abstraction of Galois Connections and Residuation with Applications to Negation, Implication, and Various Logical Operations , 1990, JELIA.

[141]  H. A. Lewis,et al.  ENTAILMENT: The Logic of Relevance and Necessity (Volume I) , 1978 .

[142]  Ayda I. Arruda.  Aspects of the historical development of paraconsistent logic , 1989 .

[143]  A. Troelstra.  Lectures on linear logic , 1992 .

[144]  N. Rescher,et al.  On inference from inconsistent premisses , 1970 .

[145]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[146]  Philip Wadler,et al.  Is there a use for linear logic? , 1991, PEPM '91.

[147]  Greg Restall,et al.  Modalities In Substructural Logics , 1994 .

[148]  Stephen Read.  What is wrong with disjunctive syllogism , 1981 .

[149]  D. Scott.  Models for Various Type-Free Calculi , 1973 .

[150]  Kimmo I. Rosenthal,et al.  Constructing locales from quantales , 1988, Mathematical Proceedings of the Cambridge Philosophical Society.

[151]  Steve Giambrone.  TW+ and RW+ are decidable , 1985, J. Philos. Log..

[152]  Martin Odersky,et al.  Call-by-name, call-by-value, call-by-need and the linear lambda calculus , 1995, MFPS.

[153]  Philip Wadler,et al.  Linear Types can Change the World! , 1990, Programming Concepts and Methods.

[154]  Chrysafis Hartonas.  Pretopology Semantics for Bimodal Intuitionistic Linear Logic , 1997, Log. J. IGPL.

[155]  M. Moortgat.  Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus , 1988 .

[156]  Vaughan R. Pratt,et al.  Dynamic algebras as a well-behaved fragment of relation algebras , 1988, Algebraic Logic and Universal Algebra in Computer Science.

[157]  John Slaney,et al.  A metacompleteness theorem for contraction-free relevant logics , 1984 .

[158]  Greg Restall,et al.  On logics without contraction , 1994 .

[159]  Mitsuhiro Okada.  Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs , 1996, Electron. Notes Theor. Comput. Sci..

[160]  R. Harrop,et al.  On disjunctions and existential statements in intuitionistic systems of logic , 1956 .

[161]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[162]  Dana S. Scott,et al.  Lambda Calculus: Some Models, Some Philosophy , 1980 .

[163]  Mati Pentus.  Models for the Lambek Calculus , 1995, Ann. Pure Appl. Log..

[164]  Dov M. Gabbay,et al.  Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[165]  Alasdair Urquhart,et al.  Decidability and the finite model property , 1981, J. Philos. Log..

[166]  Augustus de Morgan,et al.  On the Syllogism, No. IV., and on the Logic of Relations , 1864 .

[167]  Arthur N. Prior,et al.  The Runabout Inference-Ticket , 1960 .

[168]  Robert K. Meyer,et al.  Logic on the Australian plan , 1986, J. Philos. Log..

[169]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[170]  Robert Goldblatt,et al.  Orthomodularity is not elementary , 1984, Journal of Symbolic Logic.

[171]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

[172]  Moh Shaw-Kwei.  Logical Paradoxes for Many-Valued Systems , 1954, J. Symb. Log..

[173]  Mike Joy.  Lambda Calculi: A Guide For Computer Scientists , 1995 .

[174]  Robert K. Meyer.  Metacompleteness , 1976, Notre Dame J. Formal Log..

[175]  Heinrich Wansing,et al.  Sequent Calculi for Normal Modal Proposisional Logics , 1994, J. Log. Comput..

[176]  Atwell R. Turquette,et al.  On the Many-Valued Logics , 1941 .

[177]  André Fuhrmann,et al.  A relevant theory of conditionals , 1995, J. Philos. Log..

[178]  M. Stone,et al.  The Theory of Representation for Boolean Algebras , 1936 .

[179]  Richard Routley,et al.  Dialectical logic, classical logic, and the consistency of the world , 1976 .

[180]  Greg Restall.  Four-valued semantics for relevant logics (and some of their rivals) , 1995, J. Philos. Log..

[181]  Giovanni Sambin,et al.  Topology and duality in modal logic , 1988, Ann. Pure Appl. Log..

[182]  A. Church.  The calculi of lambda-conversion , 1941 .

[183]  Wei Li,et al.  On logic of paradox , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[184]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[185]  Wilhelm Ackermann,et al.  Begründung einer strengen Implikation , 1956, Journal of Symbolic Logic.

[186]  Kosta Dosen.  Sequent-systems and groupoid models. II , 1989, Stud Logica.

[187]  N. Kurtonina,et al.  Frames and Labels. A modal analysis of categorial inference , 1995 .

[188]  Hajnal Andréka,et al.  Decision problems for equational theories of relation algebras , 1997, Memoirs of the American Mathematical Society.

[189]  Kan Ching Ng,et al.  Relation algebras with transitive closure , 1984 .

[190]  Robert K. Meyer,et al.  On conserving positive logics , 1973, Notre Dame J. Formal Log..

[191]  M. Dummett.  Elements of Intuitionism , 2000 .

[192]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[193]  R. P. Dilworth,et al.  Algebraic theory of lattices , 1973 .

[194]  R. Routley,et al.  Relevantism, Material Detachment, and the Disjunctive Syllogism Argument , 1984, Canadian Journal of Philosophy.

[195]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[196]  Richard Routley,et al.  Classical relevant logics. I , 1973 .

[197]  R. Meyer,et al.  Algebraic analysis of entailment I , 1972 .

[198]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[199]  Robert K. Meyer,et al.  Combinators and Structurally Free Logic , 1997, Log. J. IGPL.

[200]  E. Beth.  The foundations of mathematics : a study in the philosophy of science , 1959 .

[201]  Kit Fine,et al.  Models for entailment , 1974, J. Philos. Log..

[202]  Alasdair Urquhart.  Many-valued Logic , 1986 .

[203]  Ross T. Brady.  Gentzenization and decidability of some contraction-less relevant logics , 1991, J. Philos. Log..

[204]  N. Rescher.  Review: Moh Shaw-Kwei, The Deduction Theorems and Two New Logical Systems , 1952 .

[205]  Kosta Dosen,et al.  Modal translations in substructural logics , 1992, J. Philos. Log..

[206]  J. Michael Dunn,et al.  Relevance Logic and Entailment , 1986 .

[207]  Stewart Shapiro,et al.  Epistemic and Intuitionistic Arithmetic , 1985 .

[208]  J. Roger Hindley,et al.  The simple semantics for Coppe-Dezani-Sallé types , 1982, Symposium on Programming.

[209]  Nuel D. Belnap,et al.  A Decision Procedure For the System EĪ of Entailment with Negation , 1965 .

[210]  R. Meyer,et al.  Intuitionism, Entailment, Negation , 1973 .

[211]  Silvio Ghilardi,et al.  Constructive Canonicity in Non-Classical Logics , 1997, Ann. Pure Appl. Log..

[212]  P. Martin-Löf.  Notes on constructive mathematics , 1970 .

[213]  Greg Restall,et al.  Negation in Relevant Logics (How I Stopped Worrying and Learned to Love the Routley Star) , 1999 .

[214]  J. Dunn.  Partial-Gaggles Applied to Logics with Restricted Structural Rules , 1991 .

[215]  Robert K. Meyer,et al.  Whither Relevant Arithmetic? , 1992, J. Symb. Log..

[216]  John L. Bell,et al.  Models and Ultraproducts: An Introduction. , 1969 .

[217]  C. Siegel.  Vorlesungen über die Algebra der Logik , 1907 .

[218]  J. Dunn,et al.  Curry's paradox , 1979 .

[219]  Robert K. Meyer,et al.  Semantics of Entailment 0 , 1993 .