54 search results - page 8 / 11 » On Proof Nets for Multiplicative Linear Logic with Units |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
ICTCS
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
JELIA
1998
Springer
14 years 2 months ago
1998
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic with exponentials. In the process we elaborate a methodology for proving mat...
LICS
1991
IEEE
14 years 1 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
DEDS
1998
13 years 9 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...