Stellar Resolution: Multiplicatives - for the linear logician, through examples
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)