scientific article; zbMATH DE number 1471980

MaRDI QIDQ4489064zbMATH OpenFDO

Authors Michael Soltys, Stephen Cook

Publication date 9 July 2000

zbMATH Keywords

Boolean functionsBoolean programsnonuniform PSPACEproof systemquantified propositional calculus

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Automata, Languages and Programming
• Nested Boolean functions as models for quantified Boolean formulas
• Computer Science Logic
• scientific article; zbMATH DE number 953683
• Boolean functions as models for quantified Boolean formulas

Cited in

(11)

• Sprague-Grundy theory in bounded arithmetic
• A theorem prover for Boolean BI
• Transformations into normal forms for quantified circuits
• Proving Valid Quantified Boolean Formulas in HOL Light
• scientific article; zbMATH DE number 65529 (Why is no real title available?)
• Complexity of fixed-size bit-vector logics
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
• Analysis of Boolean Programs
• Nested Boolean functions as models for quantified Boolean formulas
• Automata, Languages and Programming
• Non-deterministic Boolean Proof Nets

This page was built for publication:

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