The Provability of Consistency
Logic
2020-06-23 v5
Abstract
We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as a specific arithmetical formula. Our findings show that formal theories can finitely formalize proofs of certain properties presented as schemes without reducing the presentation of those properties to a single formula. We outline a theory of proving schemes in PA.
Cite
@article{arxiv.1902.07404,
title = {The Provability of Consistency},
author = {Sergei Artemov},
journal= {arXiv preprint arXiv:1902.07404},
year = {2020}
}
Comments
A compact exposition of the main result and a brief foundational discussion