Consistency and optimality

DOI10.1007/978-3-642-21875-0_7MaRDI QIDQ3091441zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Consistency, optimality, and incompleteness
• On optimal algorithms and optimal proof systems
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Complexity, decidability and completeness
• Propositional proof systems and fast consistency provers

Cites work

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

Cited in

(9)

• Approaches to consistency adjustment
• Optimality by many equally important criteria
• Propositional proof systems and fast consistency provers
• Consistency and localizability
• Potential, Value, and Consistency
• Eight concepts of optimality
• On the consistency of MPS
• Consistency, optimality, and incompleteness
• Automated Deduction – CADE-20

This page was built for publication: Consistency and optimality

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