AI Chat AI Image Generator AI Video Text to Speech

A New Linear Time Correctness Condition for Multiplicative Linear Logic

02/26/2019

∙

by Satoshi Matsuoka, et al.

∙

∙

In this paper, we give a new linear time correctness condition for proof nets of Multiplicative Linear Logic without units. Our approach is based on a rewriting system over trees. We have only three rewrite rules. Compared to previous linear time correctness conditions, our system is surprisingly simple and intuitively appealing.

page 1

page 2

page 3

page 4

research

∙ 10/01/2020

Erratum to "Frequency Linear-time Temporal Logic"

We correct our proof of a theorem stating that satisfiability of frequen...

0 Benedikt Bollig, et al. ∙

research

∙ 01/24/2021

A greedy algorithm for dropping digits (Functional Pearl)

Consider the puzzle: given a number, remove k digits such that the resul...

0 Richard Bird, et al. ∙

research

∙ 06/02/2023

The logic of temporal domination

In this short note, we are concerned with the fairness condition "A and ...

0 Thomas Studer, et al. ∙

research

∙ 12/03/2020

Modeling Adverse Conditions in the Framework of Graph Transformation Systems

The concept of adverse conditions addresses systems interacting with an ...

0 Okan Özkan, et al. ∙

research

∙ 05/28/2023

Linear-Time–Branching-Time Spectroscopy Accounting for Silent Steps

We provide the first generalized game characterization of van Glabbeek's...

0 Benjamin Bisping, et al. ∙

research

∙ 01/29/2019

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix

This paper establishes a bridge between linear logic and mainstream grap...

0 Lê Thành Dũng Nguyên, et al. ∙

research

∙ 02/21/2022

Loop unrolling of UCA models: distance labeling

A proper circular-arc (PCA) model is a pair M = (C, A) where C is a circ...

0 Francisco J. Soulignac, et al. ∙