Non-deterministic Boolean proof nets

Authors:
Virgile Mogbil
Affiliations:
LIPN, UMR, CNRS, Université Paris 13, France
Venue:
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Year:
2009

Citing 9
Cited 1

A taxonomy of problems with fast parallel algorithms

Information and Control
Linear logic

Theoretical Computer Science
A Note on Nondeterminism in Small, Fast Parallel Computers

IEEE Transactions on Computers
P-uniform circuit complexity

Journal of the ACM (JACM)
Nondeterministic circuits, space complexity and quasigroups

Theoretical Computer Science
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Proof Nets and Boolean Circuits

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Uniform Circuits, & Boolean Proof Nets

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Nondeterministic light logics and NP-time

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications

Proofs as executions

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract. 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 corresponds to Non-deterministic Boolean circuit evaluation and reciprocally. We obtain implicit characterization of the complexity classes NP and NC (the efficiently parallelizable functions).