What is the relationship between the BHK interpretation of propositional logic and Natural Deduction?












0












$begingroup$


I've been getting into intuitionistic logic lately, starting from propositional logic. I am interested in proof-theoretic semantics, meaning the idea that the truth of a proposition is derived from the existence of a proof of it. I have read different texts and while some authors mention Gentzen's Natural Deduction as the beginning of this proof theoretic semantics, many don't mention it at all and only refer to it as a proof system which is not based on axioms.

Those authors generally mention the Brouwer Heyting Kolmogorov interpretation as the source of this proof theoretic point of view, or Per Martin Lof's theory of verification.

My question is, how exactly are those three things related? Does Natural Deduction, except for being a proof system, provide proof theoretic semantics for propositional calculus? Lastly, what is the BHK interpretation regarded as exactly? I mean does it define a system of sorts?










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I've been getting into intuitionistic logic lately, starting from propositional logic. I am interested in proof-theoretic semantics, meaning the idea that the truth of a proposition is derived from the existence of a proof of it. I have read different texts and while some authors mention Gentzen's Natural Deduction as the beginning of this proof theoretic semantics, many don't mention it at all and only refer to it as a proof system which is not based on axioms.

    Those authors generally mention the Brouwer Heyting Kolmogorov interpretation as the source of this proof theoretic point of view, or Per Martin Lof's theory of verification.

    My question is, how exactly are those three things related? Does Natural Deduction, except for being a proof system, provide proof theoretic semantics for propositional calculus? Lastly, what is the BHK interpretation regarded as exactly? I mean does it define a system of sorts?










    share|cite|improve this question









    $endgroup$















      0












      0








      0


      1



      $begingroup$


      I've been getting into intuitionistic logic lately, starting from propositional logic. I am interested in proof-theoretic semantics, meaning the idea that the truth of a proposition is derived from the existence of a proof of it. I have read different texts and while some authors mention Gentzen's Natural Deduction as the beginning of this proof theoretic semantics, many don't mention it at all and only refer to it as a proof system which is not based on axioms.

      Those authors generally mention the Brouwer Heyting Kolmogorov interpretation as the source of this proof theoretic point of view, or Per Martin Lof's theory of verification.

      My question is, how exactly are those three things related? Does Natural Deduction, except for being a proof system, provide proof theoretic semantics for propositional calculus? Lastly, what is the BHK interpretation regarded as exactly? I mean does it define a system of sorts?










      share|cite|improve this question









      $endgroup$




      I've been getting into intuitionistic logic lately, starting from propositional logic. I am interested in proof-theoretic semantics, meaning the idea that the truth of a proposition is derived from the existence of a proof of it. I have read different texts and while some authors mention Gentzen's Natural Deduction as the beginning of this proof theoretic semantics, many don't mention it at all and only refer to it as a proof system which is not based on axioms.

      Those authors generally mention the Brouwer Heyting Kolmogorov interpretation as the source of this proof theoretic point of view, or Per Martin Lof's theory of verification.

      My question is, how exactly are those three things related? Does Natural Deduction, except for being a proof system, provide proof theoretic semantics for propositional calculus? Lastly, what is the BHK interpretation regarded as exactly? I mean does it define a system of sorts?







      logic proof-theory natural-deduction constructive-mathematics intuitionistic-logic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 13 '17 at 23:01









      Mano PlizziMano Plizzi

      410213




      410213






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.



          Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.



          Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.



          In short, we have an intuitionistic Natural Deduction as well as a classical one.



          Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).



          Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.



          For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.






          share|cite|improve this answer











          $endgroup$





















            2












            $begingroup$

            One could say that there is some ambiguity to the term "proof-theoretic semantics". Some people apply it to the BHK interpretation and Martin-Löfs meaning explantions. These are no formal semantics. They are called "proof-theoretic" because, as the OP already remarked, they are based on the notion of proof. In this context, the term "semantics" in "proof-theoretic semantics" is used in the broader sense of (informal) meaning explanations.



            Starting in the early seventies, Prawitz (and others) tried to combine the BHK interpretation and the inversion principle of natural deduction systems (or "deductive harmony", as it is often called today) in order to obtain a formal semantics. Roughly speaking, one could say that the properties afforded by the inversion principle (normalization, subformula property etc.) are used as an antidote against the highly impredicative character of the BHK clauses, in particular, the clause for implication. The resulting semantics actually provide formal definitions of logical validity. For these formal semantics, the questions of soundness and completeness (with respect to intuitionistic logic) are pertinent.



            A constructivist may have reservations with respect to Kripke semantics (among other things, because it is not based on the notion of proof, or construction, and because the completeness theorem relies on strictly classical reasoning in the meta level) and may favour either an informal or formal proof-theoretic semantics instead.






            share|cite|improve this answer









            $endgroup$













              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%2f2185525%2fwhat-is-the-relationship-between-the-bhk-interpretation-of-propositional-logic-a%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              2












              $begingroup$

              You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.



              Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.



              Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.



              In short, we have an intuitionistic Natural Deduction as well as a classical one.



              Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).



              Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.



              For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.






              share|cite|improve this answer











              $endgroup$


















                2












                $begingroup$

                You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.



                Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.



                Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.



                In short, we have an intuitionistic Natural Deduction as well as a classical one.



                Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).



                Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.



                For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.






                share|cite|improve this answer











                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.



                  Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.



                  Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.



                  In short, we have an intuitionistic Natural Deduction as well as a classical one.



                  Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).



                  Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.



                  For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.






                  share|cite|improve this answer











                  $endgroup$



                  You have to compare e.g. The Development of Proof Theory for an overview regarding proof systems, including Gentzen's creations: Sequent calculus and Natural Deduction, with Intuitionistic Logic.



                  Intuitionism gave birth to the first "alternative" logic, characterized by the rejection of some "classically" valid principles, like the Law of Excluded Middle.



                  Intuitionistic logic can be foramlized with suitable proof systems, i.e. with a peculiar version of the many well-known proof systems: Hilbert-style, Natural Deduction, Sequent Calculus, Tableau.



                  In short, we have an intuitionistic Natural Deduction as well as a classical one.



                  Classical logic has its standard two-valued semantics: the truth-functional one (see Boolean Algebra and the usual truth tables).



                  Intuitionsitic logic has been equipped with its own semantics, based on Brouwer–Heyting–Kolmogorov interpretation.



                  For classical logic we have a Completeness Theorem, stating that every (classically) valid formula is provable with e.g. Natural Deduction, while for intuitionistic logic we have the corresponding Completeness Theorem with respect to Heyting semantics as well as Kripke semantics.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Mar 14 '17 at 12:40

























                  answered Mar 14 '17 at 12:35









                  Mauro ALLEGRANZAMauro ALLEGRANZA

                  64.8k448112




                  64.8k448112























                      2












                      $begingroup$

                      One could say that there is some ambiguity to the term "proof-theoretic semantics". Some people apply it to the BHK interpretation and Martin-Löfs meaning explantions. These are no formal semantics. They are called "proof-theoretic" because, as the OP already remarked, they are based on the notion of proof. In this context, the term "semantics" in "proof-theoretic semantics" is used in the broader sense of (informal) meaning explanations.



                      Starting in the early seventies, Prawitz (and others) tried to combine the BHK interpretation and the inversion principle of natural deduction systems (or "deductive harmony", as it is often called today) in order to obtain a formal semantics. Roughly speaking, one could say that the properties afforded by the inversion principle (normalization, subformula property etc.) are used as an antidote against the highly impredicative character of the BHK clauses, in particular, the clause for implication. The resulting semantics actually provide formal definitions of logical validity. For these formal semantics, the questions of soundness and completeness (with respect to intuitionistic logic) are pertinent.



                      A constructivist may have reservations with respect to Kripke semantics (among other things, because it is not based on the notion of proof, or construction, and because the completeness theorem relies on strictly classical reasoning in the meta level) and may favour either an informal or formal proof-theoretic semantics instead.






                      share|cite|improve this answer









                      $endgroup$


















                        2












                        $begingroup$

                        One could say that there is some ambiguity to the term "proof-theoretic semantics". Some people apply it to the BHK interpretation and Martin-Löfs meaning explantions. These are no formal semantics. They are called "proof-theoretic" because, as the OP already remarked, they are based on the notion of proof. In this context, the term "semantics" in "proof-theoretic semantics" is used in the broader sense of (informal) meaning explanations.



                        Starting in the early seventies, Prawitz (and others) tried to combine the BHK interpretation and the inversion principle of natural deduction systems (or "deductive harmony", as it is often called today) in order to obtain a formal semantics. Roughly speaking, one could say that the properties afforded by the inversion principle (normalization, subformula property etc.) are used as an antidote against the highly impredicative character of the BHK clauses, in particular, the clause for implication. The resulting semantics actually provide formal definitions of logical validity. For these formal semantics, the questions of soundness and completeness (with respect to intuitionistic logic) are pertinent.



                        A constructivist may have reservations with respect to Kripke semantics (among other things, because it is not based on the notion of proof, or construction, and because the completeness theorem relies on strictly classical reasoning in the meta level) and may favour either an informal or formal proof-theoretic semantics instead.






                        share|cite|improve this answer









                        $endgroup$
















                          2












                          2








                          2





                          $begingroup$

                          One could say that there is some ambiguity to the term "proof-theoretic semantics". Some people apply it to the BHK interpretation and Martin-Löfs meaning explantions. These are no formal semantics. They are called "proof-theoretic" because, as the OP already remarked, they are based on the notion of proof. In this context, the term "semantics" in "proof-theoretic semantics" is used in the broader sense of (informal) meaning explanations.



                          Starting in the early seventies, Prawitz (and others) tried to combine the BHK interpretation and the inversion principle of natural deduction systems (or "deductive harmony", as it is often called today) in order to obtain a formal semantics. Roughly speaking, one could say that the properties afforded by the inversion principle (normalization, subformula property etc.) are used as an antidote against the highly impredicative character of the BHK clauses, in particular, the clause for implication. The resulting semantics actually provide formal definitions of logical validity. For these formal semantics, the questions of soundness and completeness (with respect to intuitionistic logic) are pertinent.



                          A constructivist may have reservations with respect to Kripke semantics (among other things, because it is not based on the notion of proof, or construction, and because the completeness theorem relies on strictly classical reasoning in the meta level) and may favour either an informal or formal proof-theoretic semantics instead.






                          share|cite|improve this answer









                          $endgroup$



                          One could say that there is some ambiguity to the term "proof-theoretic semantics". Some people apply it to the BHK interpretation and Martin-Löfs meaning explantions. These are no formal semantics. They are called "proof-theoretic" because, as the OP already remarked, they are based on the notion of proof. In this context, the term "semantics" in "proof-theoretic semantics" is used in the broader sense of (informal) meaning explanations.



                          Starting in the early seventies, Prawitz (and others) tried to combine the BHK interpretation and the inversion principle of natural deduction systems (or "deductive harmony", as it is often called today) in order to obtain a formal semantics. Roughly speaking, one could say that the properties afforded by the inversion principle (normalization, subformula property etc.) are used as an antidote against the highly impredicative character of the BHK clauses, in particular, the clause for implication. The resulting semantics actually provide formal definitions of logical validity. For these formal semantics, the questions of soundness and completeness (with respect to intuitionistic logic) are pertinent.



                          A constructivist may have reservations with respect to Kripke semantics (among other things, because it is not based on the notion of proof, or construction, and because the completeness theorem relies on strictly classical reasoning in the meta level) and may favour either an informal or formal proof-theoretic semantics instead.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Dec 3 '18 at 9:53









                          Hermógenes OliveiraHermógenes Oliveira

                          714




                          714






























                              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.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2185525%2fwhat-is-the-relationship-between-the-bhk-interpretation-of-propositional-logic-a%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

                              How do I know what Microsoft account the skydrive app is syncing to?

                              Grease: Live!

                              When does type information flow backwards in C++?