Non-deterministic Boolean Proof Nets

DOI10.1007/978-3-642-15331-0_9MaRDI QIDQ5747635zbMATH OpenOpenAlexFDO

Authors Virgile Mogbil

Publication date 14 September 2010

Published in Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15331-0_9

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cut-elimination and normal-form theorems (03F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• scientific article; zbMATH DE number 786497
• scientific article; zbMATH DE number 1471980
• scientific article; zbMATH DE number 7324256
• Uniform Circuits, & Boolean Proof Nets
• scientific article; zbMATH DE number 3943004
• Bounded nondeterminism of logic programs
• Proof Complexity of Non-classical Logics
• Proof complexity of non-classical logics
• scientific article; zbMATH DE number 7359406
• Proof graphs for parameterised Boolean equation systems

Cited in

(5)

• scientific article; zbMATH DE number 3943004 (Why is no real title available?)
• Uniform Circuits, & Boolean Proof Nets
• scientific article; zbMATH DE number 7324256 (Why is no real title available?)
• scientific article; zbMATH DE number 786497 (Why is no real title available?)
• Step semantics of Boolean nets

This page was built for publication: Non-deterministic Boolean Proof Nets

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