Consistency and Optimality

DOI10.1007/978-3-642-21875-0_7zbMath1345.03110OpenAlexW72404697MaRDI QIDQ3091441

Moritz Müller, Jörg Flum, Yijia Chen

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: http://ddd.uab.cat/record/77019

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Cites Work

• Unnamed Item
• Relations between diagonalization, proof systems, and complexity gaps
• On an optimal propositional proof system and the structure of easy subsets of TAUT.
• THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Logical Foundations of Proof Complexity

This page was built for publication: Consistency and Optimality