Why the 'natural' consistency proof of PA cannot be carried out $textbf{in}$ PA












1














In my proof theory monograph there is this exercise:



"The natural proof of PA cannot be carried out in PA. Why?
(This proof consists in showing that all theorems of PA are ture.)"



Apparently, by 'natural' proof he means that we accept the (usual) interpretations of the axioms of PA to be true statements and that the rules of the predicate calculus preserve truth (if one likes to consider this a proof).



Isn't the answer simply exactly the second incompleteness theorem?
It seemed too easy so I wondered whether there was more to it..



Thanks,
Ettore



Here's a link to the question on overflow:
https://mathoverflow.net/questions/319417/why-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa










share|cite|improve this question




















  • 1




    Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
    – Asaf Karagila
    Dec 4 '18 at 16:37










  • Thank you. English is not my native tongue. I hope I improved now.
    – Ettore
    Dec 4 '18 at 17:36






  • 6




    I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
    – Andreas Blass
    Dec 4 '18 at 17:49








  • 2




    Related: math.stackexchange.com/questions/2396084/…
    – Eric Wofsey
    Dec 4 '18 at 17:59






  • 3




    @Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
    – Andreas Blass
    Dec 4 '18 at 22:27
















1














In my proof theory monograph there is this exercise:



"The natural proof of PA cannot be carried out in PA. Why?
(This proof consists in showing that all theorems of PA are ture.)"



Apparently, by 'natural' proof he means that we accept the (usual) interpretations of the axioms of PA to be true statements and that the rules of the predicate calculus preserve truth (if one likes to consider this a proof).



Isn't the answer simply exactly the second incompleteness theorem?
It seemed too easy so I wondered whether there was more to it..



Thanks,
Ettore



Here's a link to the question on overflow:
https://mathoverflow.net/questions/319417/why-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa










share|cite|improve this question




















  • 1




    Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
    – Asaf Karagila
    Dec 4 '18 at 16:37










  • Thank you. English is not my native tongue. I hope I improved now.
    – Ettore
    Dec 4 '18 at 17:36






  • 6




    I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
    – Andreas Blass
    Dec 4 '18 at 17:49








  • 2




    Related: math.stackexchange.com/questions/2396084/…
    – Eric Wofsey
    Dec 4 '18 at 17:59






  • 3




    @Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
    – Andreas Blass
    Dec 4 '18 at 22:27














1












1








1







In my proof theory monograph there is this exercise:



"The natural proof of PA cannot be carried out in PA. Why?
(This proof consists in showing that all theorems of PA are ture.)"



Apparently, by 'natural' proof he means that we accept the (usual) interpretations of the axioms of PA to be true statements and that the rules of the predicate calculus preserve truth (if one likes to consider this a proof).



Isn't the answer simply exactly the second incompleteness theorem?
It seemed too easy so I wondered whether there was more to it..



Thanks,
Ettore



Here's a link to the question on overflow:
https://mathoverflow.net/questions/319417/why-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa










share|cite|improve this question















In my proof theory monograph there is this exercise:



"The natural proof of PA cannot be carried out in PA. Why?
(This proof consists in showing that all theorems of PA are ture.)"



Apparently, by 'natural' proof he means that we accept the (usual) interpretations of the axioms of PA to be true statements and that the rules of the predicate calculus preserve truth (if one likes to consider this a proof).



Isn't the answer simply exactly the second incompleteness theorem?
It seemed too easy so I wondered whether there was more to it..



Thanks,
Ettore



Here's a link to the question on overflow:
https://mathoverflow.net/questions/319417/why-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa







foundations proof-theory incompleteness meta-math provability






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 24 '18 at 14:06

























asked Dec 4 '18 at 16:32









Ettore

969




969








  • 1




    Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
    – Asaf Karagila
    Dec 4 '18 at 16:37










  • Thank you. English is not my native tongue. I hope I improved now.
    – Ettore
    Dec 4 '18 at 17:36






  • 6




    I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
    – Andreas Blass
    Dec 4 '18 at 17:49








  • 2




    Related: math.stackexchange.com/questions/2396084/…
    – Eric Wofsey
    Dec 4 '18 at 17:59






  • 3




    @Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
    – Andreas Blass
    Dec 4 '18 at 22:27














  • 1




    Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
    – Asaf Karagila
    Dec 4 '18 at 16:37










  • Thank you. English is not my native tongue. I hope I improved now.
    – Ettore
    Dec 4 '18 at 17:36






  • 6




    I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
    – Andreas Blass
    Dec 4 '18 at 17:49








  • 2




    Related: math.stackexchange.com/questions/2396084/…
    – Eric Wofsey
    Dec 4 '18 at 17:59






  • 3




    @Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
    – Andreas Blass
    Dec 4 '18 at 22:27








1




1




Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
– Asaf Karagila
Dec 4 '18 at 16:37




Admittedly, I'm not sure what you mean by "consider the axioms of PA to mean true statements", because the axioms of PA are something very concrete and explicit, whereas "true statements" (even if taken as "true in $Bbb N$") is something not very explicit, in the sense that it is not definable in $Bbb N$.
– Asaf Karagila
Dec 4 '18 at 16:37












Thank you. English is not my native tongue. I hope I improved now.
– Ettore
Dec 4 '18 at 17:36




Thank you. English is not my native tongue. I hope I improved now.
– Ettore
Dec 4 '18 at 17:36




6




6




I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
– Andreas Blass
Dec 4 '18 at 17:49






I don't think the second incompleteness theorem is the answer to that question. The theorem tells you that, if you attempt to formalize the natural proof in PA, something must go wrong. But it doesn't tell you what goes wrong. Where does the "formalized natural proof" break down? I think that's the intended question.
– Andreas Blass
Dec 4 '18 at 17:49






2




2




Related: math.stackexchange.com/questions/2396084/…
– Eric Wofsey
Dec 4 '18 at 17:59




Related: math.stackexchange.com/questions/2396084/…
– Eric Wofsey
Dec 4 '18 at 17:59




3




3




@Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
– Andreas Blass
Dec 4 '18 at 22:27




@Ettore Yes, the natural proof presupposes a truth predicate and some facts about it. And by Tarski's theorem, no truth predicate for arithmetical sentences can be defined in the language of arithmetic --- not even if the only property you require is that a sentence X and the sentence "X is not true" can't hold simultaneously.
– Andreas Blass
Dec 4 '18 at 22:27










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025795%2fwhy-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025795%2fwhy-the-natural-consistency-proof-of-pa-cannot-be-carried-out-textbfin-pa%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...