Consistency formula is strictly stronger in PA than PA-consistency

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Artemov, Sergei
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915467771248640
author Artemov, Sergei
author_facet Artemov, Sergei
contents In this note, we show that, despite the widespread assumption, the consistency formula for Peano Arithmetic PA, Con(PA), "for all x, x is not a code of a derivation of (0=1)," is not equivalent in PA to the consistency of PA. Specifically, we demonstrate that "PA is consistent" is provably in PA equivalent to the series ConS(PA) of arithmetical sentences "n is not a code of a derivation of (0=1)" for n=0,1,2,.... Since Con(PA) is strictly stronger in PA than ConS(PA), the unprovability of Con(PA) in PA does not yield the unprovability of PA-consistency.
format Preprint
id arxiv_https___arxiv_org_abs_2508_20346
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Consistency formula is strictly stronger in PA than PA-consistency
Artemov, Sergei
Logic
03A05, 03B30, 03F03, 03F07, 03F30, 03F40
F.3.0; F.4.0; F.4.1; I.2.0; I.2.3
In this note, we show that, despite the widespread assumption, the consistency formula for Peano Arithmetic PA, Con(PA), "for all x, x is not a code of a derivation of (0=1)," is not equivalent in PA to the consistency of PA. Specifically, we demonstrate that "PA is consistent" is provably in PA equivalent to the series ConS(PA) of arithmetical sentences "n is not a code of a derivation of (0=1)" for n=0,1,2,.... Since Con(PA) is strictly stronger in PA than ConS(PA), the unprovability of Con(PA) in PA does not yield the unprovability of PA-consistency.
title Consistency formula is strictly stronger in PA than PA-consistency
topic Logic
03A05, 03B30, 03F03, 03F07, 03F30, 03F40
F.3.0; F.4.0; F.4.1; I.2.0; I.2.3
url https://arxiv.org/abs/2508.20346