DeepAI AI Chat
Log In Sign Up

Stellar Resolution: Multiplicatives

by   Boris Eng, et al.

We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of three articles. As such, it is the first step towards a proper formal treatment of Girard's proposal to tackle first-order logic in a proofs-as-program approach. After establishing formal definitions and basic properties of stellar resolution, we explain how it generalises traditional models of computation, such as logic programming and combinatorial models such as Wang tilings. We then explain how it can represent multiplicative proof-structures, their cut-elimination and the correctness criterion of Danos and Regnier. Further use of realisability techniques lead to dynamic semantics for Multiplicative Linear Logic, following previous Geometry of Interaction models.


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...

Logic and computation as combinatorics

The syntactic nature of logic and computation separates them from other ...

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

The stellar resolution is an asynchronous model of computation used in G...

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

This work is the first exploration of proof-theoretic semantics for a su...

Bouncing threads for infinitary and circular proofs

We generalize the validity criterion for the infinitary proof system of ...

Coherent Interaction Graphs

We introduce the notion of coherent graphs, and show how those can be us...

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...