Why can't we prove consistency of ZFC like we can for PA?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
3
down vote

favorite












this might be a silly question, but I was wondering: PA cannot prove its consistency by the incompleteness theorems, but we can "step outside" and exhibit a model of it, namely $mathbbN$, so we know that PA is consistent.



Why can't we do this with ZFC? I have seen things like "if $kappa$ is [some large cardinal] then $V_kappa$ models ZFC", but these stem from an "if".



Is this a case of us not having been able to do this yet, or is there a good reason why it is simply not possible?










share|cite|improve this question



















  • 5




    Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
    – Malice Vidrine
    1 hour ago














up vote
3
down vote

favorite












this might be a silly question, but I was wondering: PA cannot prove its consistency by the incompleteness theorems, but we can "step outside" and exhibit a model of it, namely $mathbbN$, so we know that PA is consistent.



Why can't we do this with ZFC? I have seen things like "if $kappa$ is [some large cardinal] then $V_kappa$ models ZFC", but these stem from an "if".



Is this a case of us not having been able to do this yet, or is there a good reason why it is simply not possible?










share|cite|improve this question



















  • 5




    Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
    – Malice Vidrine
    1 hour ago












up vote
3
down vote

favorite









up vote
3
down vote

favorite











this might be a silly question, but I was wondering: PA cannot prove its consistency by the incompleteness theorems, but we can "step outside" and exhibit a model of it, namely $mathbbN$, so we know that PA is consistent.



Why can't we do this with ZFC? I have seen things like "if $kappa$ is [some large cardinal] then $V_kappa$ models ZFC", but these stem from an "if".



Is this a case of us not having been able to do this yet, or is there a good reason why it is simply not possible?










share|cite|improve this question















this might be a silly question, but I was wondering: PA cannot prove its consistency by the incompleteness theorems, but we can "step outside" and exhibit a model of it, namely $mathbbN$, so we know that PA is consistent.



Why can't we do this with ZFC? I have seen things like "if $kappa$ is [some large cardinal] then $V_kappa$ models ZFC", but these stem from an "if".



Is this a case of us not having been able to do this yet, or is there a good reason why it is simply not possible?







logic set-theory model-theory incompleteness






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 1 hour ago









Asaf Karagila♦

298k32417745




298k32417745










asked 1 hour ago









K. 622

32116




32116







  • 5




    Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
    – Malice Vidrine
    1 hour ago












  • 5




    Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
    – Malice Vidrine
    1 hour ago







5




5




Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
– Malice Vidrine
1 hour ago




Stepping outside PA is an "if". We prove PA is consistent if ZFC is.
– Malice Vidrine
1 hour ago










3 Answers
3






active

oldest

votes

















up vote
3
down vote













Using ZFC plus the axiom "Uncountable strong inaccessible cardinals exist" to give a model of ZFC is exactly the same kind of "stepping outside" as when you use ZF to make a model of PA.






share|cite|improve this answer




















  • Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
    – K. 622
    1 hour ago

















up vote
3
down vote













The problem is that, unlike the case for PA, essentially all accepted mathematical reasoning can be formalized in ZFC. Any proof of the consistency of ZFC must come from a system that is stronger (at least in some ways), so we must go outside ZFC-formalizable mathematics, which is most of mathmatics. (Just like we go outside of PA-formalizable mathematics to prove the consistency of PA.)



For instance, as you mention, we could go to a stronger system where there is an axiom giving the existence of inaccessible cardinals. Working in Morse-Kelley is another possibility (though this is in a lot of ways pretty similar to positing inaccessible cardinals). In any case, you are in the same position with the stronger system as you were with ZFC: you cannot use it to prove its own consistency.






share|cite|improve this answer






















  • Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
    – K. 622
    1 hour ago










  • @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
    – spaceisdarkgreen
    58 mins ago

















up vote
1
down vote













Of course we can. And we do just that.



To "step outside of $sf PA$" means that you assume the consistency of a far stronger theory, e.g. $sf ZFC$, which lets you construct $Bbb N$ as an object and prove it satisfies $sf PA$.



When you say "assume that $kappa$ is a cardinal such that $V_kappa$ is a model of $sf ZFC$" you effectively saying "We are stepping outside of $sf ZFC$ into a theory "$sf ZFC+varphi$ for a suitable axiom $varphi$, and there we can can find a model of $sf ZFC$.



In fact, when you assume something like $V_kappa$ is a model of $sf ZFC$, you can even find a fairly canonical model of $sf ZFC$: $L_alpha$ for the least $alpha$ satisfying $sf ZFC$, where $L_alpha$ is the $alpha$th step in the constructible hierarchy. As to why it exists, that's another question. But it is there.






share|cite|improve this answer




















    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',
    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%2f2981986%2fwhy-cant-we-prove-consistency-of-zfc-like-we-can-for-pa%23new-answer', 'question_page');

    );

    Post as a guest






























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    3
    down vote













    Using ZFC plus the axiom "Uncountable strong inaccessible cardinals exist" to give a model of ZFC is exactly the same kind of "stepping outside" as when you use ZF to make a model of PA.






    share|cite|improve this answer




















    • Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
      – K. 622
      1 hour ago














    up vote
    3
    down vote













    Using ZFC plus the axiom "Uncountable strong inaccessible cardinals exist" to give a model of ZFC is exactly the same kind of "stepping outside" as when you use ZF to make a model of PA.






    share|cite|improve this answer




















    • Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
      – K. 622
      1 hour ago












    up vote
    3
    down vote










    up vote
    3
    down vote









    Using ZFC plus the axiom "Uncountable strong inaccessible cardinals exist" to give a model of ZFC is exactly the same kind of "stepping outside" as when you use ZF to make a model of PA.






    share|cite|improve this answer












    Using ZFC plus the axiom "Uncountable strong inaccessible cardinals exist" to give a model of ZFC is exactly the same kind of "stepping outside" as when you use ZF to make a model of PA.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered 1 hour ago









    Arthur

    106k7101183




    106k7101183











    • Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
      – K. 622
      1 hour ago
















    • Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
      – K. 622
      1 hour ago















    Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
    – K. 622
    1 hour ago




    Ooh I see. I was essentially confused from reading "we know PA is consistent" elsewhere, when I should have interpreted that as "within the standard system we use today, PA is consistent". Thank you for clearing that up.
    – K. 622
    1 hour ago










    up vote
    3
    down vote













    The problem is that, unlike the case for PA, essentially all accepted mathematical reasoning can be formalized in ZFC. Any proof of the consistency of ZFC must come from a system that is stronger (at least in some ways), so we must go outside ZFC-formalizable mathematics, which is most of mathmatics. (Just like we go outside of PA-formalizable mathematics to prove the consistency of PA.)



    For instance, as you mention, we could go to a stronger system where there is an axiom giving the existence of inaccessible cardinals. Working in Morse-Kelley is another possibility (though this is in a lot of ways pretty similar to positing inaccessible cardinals). In any case, you are in the same position with the stronger system as you were with ZFC: you cannot use it to prove its own consistency.






    share|cite|improve this answer






















    • Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
      – K. 622
      1 hour ago










    • @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
      – spaceisdarkgreen
      58 mins ago














    up vote
    3
    down vote













    The problem is that, unlike the case for PA, essentially all accepted mathematical reasoning can be formalized in ZFC. Any proof of the consistency of ZFC must come from a system that is stronger (at least in some ways), so we must go outside ZFC-formalizable mathematics, which is most of mathmatics. (Just like we go outside of PA-formalizable mathematics to prove the consistency of PA.)



    For instance, as you mention, we could go to a stronger system where there is an axiom giving the existence of inaccessible cardinals. Working in Morse-Kelley is another possibility (though this is in a lot of ways pretty similar to positing inaccessible cardinals). In any case, you are in the same position with the stronger system as you were with ZFC: you cannot use it to prove its own consistency.






    share|cite|improve this answer






















    • Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
      – K. 622
      1 hour ago










    • @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
      – spaceisdarkgreen
      58 mins ago












    up vote
    3
    down vote










    up vote
    3
    down vote









    The problem is that, unlike the case for PA, essentially all accepted mathematical reasoning can be formalized in ZFC. Any proof of the consistency of ZFC must come from a system that is stronger (at least in some ways), so we must go outside ZFC-formalizable mathematics, which is most of mathmatics. (Just like we go outside of PA-formalizable mathematics to prove the consistency of PA.)



    For instance, as you mention, we could go to a stronger system where there is an axiom giving the existence of inaccessible cardinals. Working in Morse-Kelley is another possibility (though this is in a lot of ways pretty similar to positing inaccessible cardinals). In any case, you are in the same position with the stronger system as you were with ZFC: you cannot use it to prove its own consistency.






    share|cite|improve this answer














    The problem is that, unlike the case for PA, essentially all accepted mathematical reasoning can be formalized in ZFC. Any proof of the consistency of ZFC must come from a system that is stronger (at least in some ways), so we must go outside ZFC-formalizable mathematics, which is most of mathmatics. (Just like we go outside of PA-formalizable mathematics to prove the consistency of PA.)



    For instance, as you mention, we could go to a stronger system where there is an axiom giving the existence of inaccessible cardinals. Working in Morse-Kelley is another possibility (though this is in a lot of ways pretty similar to positing inaccessible cardinals). In any case, you are in the same position with the stronger system as you were with ZFC: you cannot use it to prove its own consistency.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited 1 hour ago

























    answered 1 hour ago









    spaceisdarkgreen

    30.6k21551




    30.6k21551











    • Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
      – K. 622
      1 hour ago










    • @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
      – spaceisdarkgreen
      58 mins ago
















    • Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
      – K. 622
      1 hour ago










    • @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
      – spaceisdarkgreen
      58 mins ago















    Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
    – K. 622
    1 hour ago




    Thank you your answer, that makes perfect sense. As I mentioned on the other answer, I think the confusion came from reading "we know PA is consistent" in the wrong light.
    – K. 622
    1 hour ago












    @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
    – spaceisdarkgreen
    58 mins ago




    @K. 622 That’s right. In a very crude (and possibly contentious) approximation “we know” $approx$ “ZFC proves”
    – spaceisdarkgreen
    58 mins ago










    up vote
    1
    down vote













    Of course we can. And we do just that.



    To "step outside of $sf PA$" means that you assume the consistency of a far stronger theory, e.g. $sf ZFC$, which lets you construct $Bbb N$ as an object and prove it satisfies $sf PA$.



    When you say "assume that $kappa$ is a cardinal such that $V_kappa$ is a model of $sf ZFC$" you effectively saying "We are stepping outside of $sf ZFC$ into a theory "$sf ZFC+varphi$ for a suitable axiom $varphi$, and there we can can find a model of $sf ZFC$.



    In fact, when you assume something like $V_kappa$ is a model of $sf ZFC$, you can even find a fairly canonical model of $sf ZFC$: $L_alpha$ for the least $alpha$ satisfying $sf ZFC$, where $L_alpha$ is the $alpha$th step in the constructible hierarchy. As to why it exists, that's another question. But it is there.






    share|cite|improve this answer
























      up vote
      1
      down vote













      Of course we can. And we do just that.



      To "step outside of $sf PA$" means that you assume the consistency of a far stronger theory, e.g. $sf ZFC$, which lets you construct $Bbb N$ as an object and prove it satisfies $sf PA$.



      When you say "assume that $kappa$ is a cardinal such that $V_kappa$ is a model of $sf ZFC$" you effectively saying "We are stepping outside of $sf ZFC$ into a theory "$sf ZFC+varphi$ for a suitable axiom $varphi$, and there we can can find a model of $sf ZFC$.



      In fact, when you assume something like $V_kappa$ is a model of $sf ZFC$, you can even find a fairly canonical model of $sf ZFC$: $L_alpha$ for the least $alpha$ satisfying $sf ZFC$, where $L_alpha$ is the $alpha$th step in the constructible hierarchy. As to why it exists, that's another question. But it is there.






      share|cite|improve this answer






















        up vote
        1
        down vote










        up vote
        1
        down vote









        Of course we can. And we do just that.



        To "step outside of $sf PA$" means that you assume the consistency of a far stronger theory, e.g. $sf ZFC$, which lets you construct $Bbb N$ as an object and prove it satisfies $sf PA$.



        When you say "assume that $kappa$ is a cardinal such that $V_kappa$ is a model of $sf ZFC$" you effectively saying "We are stepping outside of $sf ZFC$ into a theory "$sf ZFC+varphi$ for a suitable axiom $varphi$, and there we can can find a model of $sf ZFC$.



        In fact, when you assume something like $V_kappa$ is a model of $sf ZFC$, you can even find a fairly canonical model of $sf ZFC$: $L_alpha$ for the least $alpha$ satisfying $sf ZFC$, where $L_alpha$ is the $alpha$th step in the constructible hierarchy. As to why it exists, that's another question. But it is there.






        share|cite|improve this answer












        Of course we can. And we do just that.



        To "step outside of $sf PA$" means that you assume the consistency of a far stronger theory, e.g. $sf ZFC$, which lets you construct $Bbb N$ as an object and prove it satisfies $sf PA$.



        When you say "assume that $kappa$ is a cardinal such that $V_kappa$ is a model of $sf ZFC$" you effectively saying "We are stepping outside of $sf ZFC$ into a theory "$sf ZFC+varphi$ for a suitable axiom $varphi$, and there we can can find a model of $sf ZFC$.



        In fact, when you assume something like $V_kappa$ is a model of $sf ZFC$, you can even find a fairly canonical model of $sf ZFC$: $L_alpha$ for the least $alpha$ satisfying $sf ZFC$, where $L_alpha$ is the $alpha$th step in the constructible hierarchy. As to why it exists, that's another question. But it is there.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 1 hour ago









        Asaf Karagila♦

        298k32417745




        298k32417745



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2981986%2fwhy-cant-we-prove-consistency-of-zfc-like-we-can-for-pa%23new-answer', 'question_page');

            );

            Post as a guest













































































            Popular posts from this blog

            How to check contact read email or not when send email to Individual?

            Displaying single band from multi-band raster using QGIS

            How many registers does an x86_64 CPU actually have?