Game Characterizations and the PSPACE-Completeness of Tree Resolution Space

DOI10.1007/978-3-540-74915-8_39MaRDI QIDQ3608436zbMATH OpenOpenAlexFDO

Authors Alexander Wolfgang Karl Kurt Hertel, Alasdair Urquhart

Publication date 5 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74915-8_39

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Recommendations

• A combinatorial characterization of treelike resolution space
• A game characterisation of tree-like Q-resolution size
• A game characterisation of tree-like Q-resolution size
• A characterization of tree-like resolution size
• Proofs as Games

Cited in

(7)

• A combinatorial characterization of treelike resolution space
• Lit-only \(\sigma \)-game on pseudo-trees
• A characterization of tree-like resolution size
• A game characterisation of tree-like Q-resolution size
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• A Logical Autobiography
• A game characterisation of tree-like Q-resolution size

This page was built for publication: Game Characterizations and the PSPACE-Completeness of Tree Resolution Space

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