Proof Complexity of Non-classical Logics

DOI10.1007/978-3-642-13562-0_3MaRDI QIDQ5900979zbMATH OpenOpenAlexWikidataFDO

Authors Olaf Beyersdorff

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://eprints.whiterose.ac.uk/74776/10/beyersdorff.pdf

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• Proof complexity of non-classical logics
• scientific article; zbMATH DE number 65760
• On lengths of proofs in non-classical logics
• Logical foundations of proof complexity
• Logical Foundations of Proof Complexity
• Proof analysis in non-classical logics
• Complexity Results for Nonmonotonic Logics
• scientific article; zbMATH DE number 2110622
• Proof complexity of propositional default logic
• Proof complexity of propositional default logic

Cited in

(15)

• Towards NP-P via proof complexity and search
• scientific article; zbMATH DE number 1500525 (Why is no real title available?)
• Non-deterministic Boolean Proof Nets
• Complexity Results for Nonmonotonic Logics
• scientific article; zbMATH DE number 3903964 (Why is no real title available?)
• Proof complexity of non-classical logics
• A recipe for the complexity analysis of non-classical logics
• Different approaches to proof systems
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• Alasdair Urquhart on nonclassical and algebraic logic and complexity of proofs
• scientific article; zbMATH DE number 937363 (Why is no real title available?)
• scientific article; zbMATH DE number 6131588 (Why is no real title available?)
• Logics for complexity classes
• Towards NP-P via proof complexity and search
• Logics which capture complexity classes over the reals

This page was built for publication: Proof Complexity of Non-classical Logics

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