scientific article; zbMATH DE number 1471980

zbMATH Open0951.03052MaRDI QIDQ4489064FDOQ4489064

Authors: Michael Soltys, Stephen Cook 

Publication date: 9 July 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Boolean functionsproof systemBoolean programsquantified propositional calculusnonuniform PSPACE

Mathematics Subject Classification ID

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

Cited In (11)

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

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)