What do we know when we know that a theory is consistent?

Authors:
Gilles Dowek
Affiliations:
École polytechnique and INRIA, LIX, École polytechnique, Palaiseau Cedex, France
Venue:
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Year:
2005

Citing 7
Cited 0

Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
What Is a Theory?

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Constrained resolution: a complete method for higher-order logic.

Constrained resolution: a complete method for higher-order logic.
Theorem Proving Modulo

Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic

Mathematical Structures in Computer Science
A mechanization of type theory

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula ⊥?