Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

06/08/2023
by   Alexander V. Gheorghiu, et al.
0

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist's B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL, in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2022

Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...
research
07/14/2022

A fundamental non-classical logic

We give a proof-theoretic as well as a semantic characterization of a lo...
research
02/17/2023

Categorical Proof-Theoretic Semantics

In proof-theoretic semantics, model-theoretic validity is replaced by pr...
research
10/11/2022

Negation-as-Failure in the Base-extension Semantics for Intuitionistic Propositional Logic

Proof-theoretic semantics (P-tS) is the paradigm of semantics in which m...
research
07/31/2020

Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...
research
05/08/2000

A Denotational Semantics for First-Order Logic

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational ...
research
08/05/2022

Basic Elements of Logical Graphs

We considers how a particular kind of graph corresponds to multiplicativ...

Please sign up or login with your details

Forgot password? Click here to reset