Stellar Resolution: Multiplicatives – for the linear logician, through examples

12/07/2020
by   Boris Eng, et al.
0

The stellar resolution is an asynchronous model of computation used in Girard's Transcendental Syntax which is based on Robinson's first-order clausal resolution. By using methods of realisability for linear logic, we obtain a new model of multiplicative linear logic (MLL) based on sort of logic programs called constellations which are used to represent proofs, cut-elimination, formulas/types, correctness and provability very naturally. A philosophical justification of these works coming from the Kantian inspirations of Girard would be to study the conditions of possibility of logic, that is the conditions from which logical constructions emerge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2022

Multiplicative linear logic from a resolution-based tile system

We present the stellar resolution, a "flexible" tile system based on Rob...
research
07/31/2020

Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...
research
12/30/2021

Super Exponentials in Linear Logic

Following the idea of Subexponential Linear Logic and Stratified Bounded...
research
07/30/2020

Logic of fusion

The starting point of this work is the observation that the Curry-Howard...
research
06/13/2023

Logic and computation as combinatorics

The syntactic nature of logic and computation separates them from other ...
research
05/22/2023

Graphical Proof Theory I: Multiplicative Linear Logic Beyond Cographs

Cographs are a class of (undirected) graphs, characterized by the absenc...
research
03/09/2000

Linear Tabulated Resolution Based on Prolog Control Strategy

Infinite loops and redundant computations are long recognized open probl...

Please sign up or login with your details

Forgot password? Click here to reset