A logical calculus for modelling interferences

Authors:
Christophe Fouqueré
Affiliations:
LIPN, UMR, CNRS, Université Paris 13, Villetaneuse, France
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 8
Cited 0

Linear logic

Theoretical Computer Science
Efficient Resource Management for Linear Logic Proof Search

ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science
Soft linear logic and polynomial time

Theoretical Computer Science - Implicit computational complexity
Syntax vs. semantics: a polarized approach

Theoretical Computer Science - Game theory meets theoretical computer science
A system of interaction and structure

ACM Transactions on Computational Logic (TOCL)
Jump from parallel to sequential proofs: multiplicatives

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
L-Nets, strategies and proof-nets

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal with multisequent structures and has the cut-elimination property. Extensions are proposed that give first results concerning our objectives.