Uniform Circuits, & Boolean Proof Nets

DOI10.1007/978-3-540-72734-7_28MaRDI QIDQ5434522zbMATH OpenOpenAlexFDO

Authors Virgile Mogbil, Vincent Rahli

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_28

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 7324256
• Non-deterministic Boolean Proof Nets
• Unification nets: canonical proof net quantifiers
• Proof nets for unit-free multiplicative-additive linear logic
• MALL proof equivalence is logspace-complete, via binary decision diagrams

Cited in

(8)

• A type-assignment of linear erasure and duplication
• Step semantics of Boolean nets
• Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
• P-uniform circuit complexity
• scientific article; zbMATH DE number 3959282 (Why is no real title available?)
• Extensional Uniformity for Boolean Circuits
• Non-deterministic Boolean Proof Nets
• scientific article; zbMATH DE number 7324256 (Why is no real title available?)

This page was built for publication: Uniform Circuits, & Boolean Proof Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434522)