### Communities

tag:snake search within a tag
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
created:<1w created < 1 week ago
post_type:xxxx type of post
Q&A

# is arithmetic finitely consistent?

+4
−1

i have also asked this question on MSE - https://math.stackexchange.com/questions/4863426/is-arithmetic-finitely-consistent

no reply , as of the moment i'm writing this post.

Let's take PA1 for example. From godel's 2nd incompleteness theorem, PA1 can't prove its own consistency, more specifically it can't prove that the largest consistent subset of the theory is PA1 itself.

But PA1 has infinite axioms, so can PA1 prove atleast for a given finite set of axioms ( of PA1 ) that they are consistent, specifically that no contradictional proof exists which uses only those axioms ?

Or any formal theory of arithmetic for that matter, can it prove for a finite subset of its own axioms that they are consistent ?

Why does this post require moderator attention?