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

2023/05/17 by Dowek, Gilles
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2305.10012

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 False?

Related

• Is mathematics consistent?
• A note on the consistency operator
• Serial Properties, Selector Proofs, and the Provability of Consistency
• Relative normalization
• Consistency Decision