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

by   Boris Eng, et al.

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.


page 1

page 2

page 3

page 4


Multiplicative linear logic from a resolution-based tile system

We present the stellar resolution, a "flexible" tile system based on Rob...

Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...

Logic of fusion

The starting point of this work is the observation that the Curry-Howard...

Super Exponentials in Linear Logic

Following the idea of Subexponential Linear Logic and Stratified Bounded...

Linear Tabulated Resolution Based on Prolog Control Strategy

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

Resolution Guarantees for the Reconstruction of Inclusions in Linear Elasticity Based on Monotonicity Methods

We deal with the reconstruction of inclusions in elastic bodies based on...

Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...