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 ⊥?
['Gilles Dowek']
What do we know when we know that a theory is consistent