[PDF][PDF] A dialectica-like interpretation of a linear mso on infinite words

P Pradic, C Riba - … on Foundations of Software Science and …, 2019 - library.oapen.org
We devise a variant of Dialectica interpretation of intuitionistic linear logic for LMSO, a linear
logic-based version MSO over infinite words. LMSO was known to be correct and complete …

Multiple conclusion linear logic: cut elimination and more

H Eades III, V De Paiva - Journal of Logic and Computation, 2020 - academic.oup.com
Full intuitionistic linear logic (FILL) was first introduced by Hyland and de Paiva, and went
against current beliefs that it was not possible to incorporate all of the linear connectives, eg …

Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix

LTD Nguyên - Logical Methods in Computer Science, 2020 - lmcs.episciences.org
This paper establishes a bridge between linear logic and mainstream graph theory, building
on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+ Mix …

[PDF][PDF] Toward Curry-Howard Approaches to MSO and Automata on Infinite Words and Trees

C Riba - 2019 - perso.ens-lyon.fr
We present works aiming at proposing a Curry-Howard approach to Monadic Second-Order
Logic (MSO) on infinite trees and ω-words. Rabin's Tree Theorem, the decidability of MSO …

[PDF][PDF] UNIQUE PERFECT MATCHINGS, EDGE-COLORED GRAPHS AND PROOF NETS FOR LINEAR LOGIC WITH MIX

DN LÊ THÀNH - arXiv preprint arXiv:1901.10247, 2019 - academia.edu
This paper establishes a bridge between linear logic and mainstream graph theory, building
on previous work by Retoré (2003). We show that the problem of correctness for MLL+ Mix …