Non-deterministic Boolean Proof Nets


We introduce Non-deterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Non-deterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean types, we prove that the cut-elimination procedure… (More)
DOI: 10.1007/978-3-642-15331-0_9


5 Figures and Tables

Cite this paper

@inproceedings{Mogbil2009NondeterministicBP, title={Non-deterministic Boolean Proof Nets}, author={Virgile Mogbil}, booktitle={FOPARA}, year={2009} }