Substructural Logics on Display

  title={Substructural Logics on Display},
  author={Rajeev Gor{\'e}},
  journal={Log. J. IGPL},
  • R. Goré
  • Published 1 May 1998
  • Philosophy, Computer Science
  • Log. J. IGPL
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 (intuitionistic) 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… 

Figures and Tables from this paper

Towards Universal Logic: Gaggle Logics

It is proved that the cut rule can be systematically eliminated from proofs and it is shown how sound and complete calculi can be systematic computed from any basic gaggle logic with or without Boolean connectives.

A comparison between monoidal and substructural logics

It is argued that monoidal logics provide a more flexible foundational framework that enables a finer analysis of the relationship between negation(s) and other logical connectives and shows that the elimination of double negation is independent from the de Morgan dualities.

Cut-elimination and Proof Search for Bi-Intuitionistic Tense Logic

The calculus LBiKt is formulated in a variant of display calculus, using a form of sequents called nested sequents, and it is shown that these structural rules can be made redundant in another calculus, DBiKT, which uses deep inference, allowing one to apply inference rules at an arbitrary depth in a nested sequent.

Linear Logic Properly Displayed

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut elimination and

Displaying updates in logic

The language of substructural logics interpreted over the ternary relational semantics is generalized and three triples of connectives that are interconnected by means of cyclic permutations are introduced.

A Local System for Intuitionistic Logic

  • A. Tiu
  • Computer Science, Philosophy
  • 2006
It is shown that the use of deep inference allows for modular extensions of intuitionistic logic to Dummett's intermediate logic LC, Godel logic and classical logic, and several of its extensions in which all the propositional rules are local.

Monoidal logics: completeness and classical systems

It is shown that monoidal logics are sound and complete with respect to associative display logics, thus providing a completeness result with regards to the algebraic semantics of display and substructural logics.

Tools for the Investigation of Substructural , Intermediate and Paraconsistent Logics

Systematic and algorithmic procedures for the automated generation of analytic calculi to establish important properties for the formalized logics, and the introduction of the framework TINC (Tools for the Investigation of Non-Classical logics) to provide computer support for the contributions.

Unified Correspondence as a Proof-Theoretic Tool

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap, and applies unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics.

On the Universality of Atomic and Molecular Logics via Protologics

It is proved that every pure predicate logic with $$k\ge 0$$ k ≥ 0 variables and constants is as expressive as a predicate atomic logic, some sort of atomic logic.



Intuitionistic formal spaces and their neighbourhood

Logics without the contraction rule

This paper will study syntactical properties of logics in a Gentzen-type formal system more comprehensively and notices here that the distributive law is violated.

Relational Proof System for Linear and Other Substructural Logics

  • W. MacCaull
  • Computer Science, Philosophy
    Log. J. IGPL
  • 1997
This paper gives relational semantics and an accompanying relational proof system for a variety of intuitionistic substructural logics, including (intuitionistic) linear logic with exponentials and relational logic RFLX for each extension X.

Sequent-systems and groupoid models. I

The purpose of this paper is to connect the proof theory and the model theory of a family of propositional logics weaker than Heyting's. This family includes systems analogous to the Lambek calculus

Sequent-systems and groupoid models. II

The purpose of this paper is to connect the proof theory and the model theory of a family of prepositional logics weaker than Heyting's, a correspondence theory analogous to the correspondence theory for modal axioms of normal modal logics.

Kripke models for linear logic

Abstract We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one

Dual-Intuitionistic Logic

Cut-elimination and decidability are proved for the extended systems LJ and LDJ, and a simply consistent but ω-inconsistent Set Theory with Unrestricted Comprehension Schema based on LDJ is sketched.

Full Intuitionistic Linear Logic (extended abstract)

Translation of Hypersequents into Display Sequents

As we have seen in Chapter 2, the study of nonclassical and modal logics has led to the development of many generalizations of the ordinary notion of sequent. In view of the diversity of these types

Predicate Logics on Display

  • H. Wansing
  • Philosophy, Computer Science
    Stud Logica
  • 1999
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