• Aucun résultat trouvé

Correctness of Linear Logic Proof Structures is NL-Complete

N/A
N/A
Protected

Academic year: 2021

Partager "Correctness of Linear Logic Proof Structures is NL-Complete"

Copied!
24
0
0

Texte intégral

Références

Documents relatifs

In this note, we prove that the density of the free additive convolution of two Borel probability measures supported on R whose Cauchy transforms behave well at innity can be

Our own proposal is to develop an xml specification of mathematical proof which should be adequate to represent proofs as given by Hardy and Wright ; in a second step, one would have

In this talk, I present an agent architecture in which thinking is modeled as activating links in a connection graph of goals and beliefs, represented in abductive logic

Deciding the correctness of unit-free MLL proof structures, MELL proof struc- tures, and unit-free IMLL essential nets where problems known to be decidable in deterministic,

Quantum electrodynamics tells us, though, that the energy of the passing photons is not well defined and that from time to time, one of these photons creates an electron-hole

- The paper présents a formai description of the medium access protocol used in the Cambridge Ring, and aproofthat the protocol recovers from transient transmission

With the dimension shrink and the clock frequency increase, power consumption, delay time and parasitic crosstalk level require a strong decrease in order to maintain

varieties up to isogeny (a free group generated by simple abelian varieties up to isogeny), is the subgroup generated by the Jacobians the whole group? It would actually suffice if