Universal quantifiers in category theory












2














I’ve recently learned about the curry howard isomorphism for dependent type theory, and I’m now interested in learning about how to capture this in category theory.



I believe that I understand how to frame propositional logic in category theory: Every proposition is an object, and a proof of a proposition is a morphism from $T$ to that object, and we assume the category is cartesian closed. $A$ implies $B$ is assumed as an axiom by positing a morphism from $T$ to the exponential object $B^A$. A conjunction between $A$ and $B$ is true if there is a morphism from $T$ to $Atimes B$, and to the coproduct for a disjunction. A negation of a proposition $A$ is represented by a morphism from $A$ to type “bottom” which is uninhabited.



But I’m not sure how to represent universal quantifiers and existential quantifiers, and I couldn’t really understand the texts I found online.










share|cite|improve this question



























    2














    I’ve recently learned about the curry howard isomorphism for dependent type theory, and I’m now interested in learning about how to capture this in category theory.



    I believe that I understand how to frame propositional logic in category theory: Every proposition is an object, and a proof of a proposition is a morphism from $T$ to that object, and we assume the category is cartesian closed. $A$ implies $B$ is assumed as an axiom by positing a morphism from $T$ to the exponential object $B^A$. A conjunction between $A$ and $B$ is true if there is a morphism from $T$ to $Atimes B$, and to the coproduct for a disjunction. A negation of a proposition $A$ is represented by a morphism from $A$ to type “bottom” which is uninhabited.



    But I’m not sure how to represent universal quantifiers and existential quantifiers, and I couldn’t really understand the texts I found online.










    share|cite|improve this question

























      2












      2








      2


      1





      I’ve recently learned about the curry howard isomorphism for dependent type theory, and I’m now interested in learning about how to capture this in category theory.



      I believe that I understand how to frame propositional logic in category theory: Every proposition is an object, and a proof of a proposition is a morphism from $T$ to that object, and we assume the category is cartesian closed. $A$ implies $B$ is assumed as an axiom by positing a morphism from $T$ to the exponential object $B^A$. A conjunction between $A$ and $B$ is true if there is a morphism from $T$ to $Atimes B$, and to the coproduct for a disjunction. A negation of a proposition $A$ is represented by a morphism from $A$ to type “bottom” which is uninhabited.



      But I’m not sure how to represent universal quantifiers and existential quantifiers, and I couldn’t really understand the texts I found online.










      share|cite|improve this question













      I’ve recently learned about the curry howard isomorphism for dependent type theory, and I’m now interested in learning about how to capture this in category theory.



      I believe that I understand how to frame propositional logic in category theory: Every proposition is an object, and a proof of a proposition is a morphism from $T$ to that object, and we assume the category is cartesian closed. $A$ implies $B$ is assumed as an axiom by positing a morphism from $T$ to the exponential object $B^A$. A conjunction between $A$ and $B$ is true if there is a morphism from $T$ to $Atimes B$, and to the coproduct for a disjunction. A negation of a proposition $A$ is represented by a morphism from $A$ to type “bottom” which is uninhabited.



      But I’m not sure how to represent universal quantifiers and existential quantifiers, and I couldn’t really understand the texts I found online.







      logic type-theory categorical-logic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 18 at 14:49









      user56834

      3,17821149




      3,17821149






















          1 Answer
          1






          active

          oldest

          votes


















          2














          Assuming you are interested only in the Curry-Howard-Lambek type of interpretations of logic in categories then in order to interpret first-order logic in a category cartesian closed categories are not sufficient.



          The problem lies in the fact that you need a category whose objects represents not only propositions, i.e. closed formulas, but predicates as well (i.e. formulas with vatiables).



          In order to do this one needs some sort of fibered categories (or indexed ones if you prefer).



          The basic idea is the following: instead of having a category of propositions you have for any set of variables $X$, a category of formulas with free variables in $X$, and for every term substitution $sigma colon X to T_Sigma(Y)$ (where by $T_Sigma(Y)$ I mean the set of terms in a signature $Sigma$ and with variables in $Y$) we have a substitution functor between the categories indexed by $X$ and $Y$.



          These data are required to satisfy some additional conditions that are needed to make all work out.



          Without dealing with the details I can tell you this,
          you clearly have and obvious substitution $X to X amalg {bullet}$ which adds a new variable to $X$, this substitution induces a functor between the categories associated to $X$ and $Xamalg{bullet}$ (which I remind are made of formulas with the appropriate variables). This functor basically send every formula with variables in $X$ in the same formula seen as a formula with variables in $X amalg {bullet}$.



          This functor has both a left and right adjoint which are respectively the universal and existential quatifier: these adjoint functors take formulas in $X amalg{bullet}$-variables and give back formulas in $X$-variables.



          Again the details require to know fibered or indexed categories at least, so I am not sure that a full answer can be given here.



          If you are interested to some pointers I suggest to read Bart Jacobs' "Categorical Type Theory" that deals in details with these subject.



          I hope I was able to give you the raw idea, in case you needed any additional clarification please ask.






          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',
            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%2f3003621%2funiversal-quantifiers-in-category-theory%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2














            Assuming you are interested only in the Curry-Howard-Lambek type of interpretations of logic in categories then in order to interpret first-order logic in a category cartesian closed categories are not sufficient.



            The problem lies in the fact that you need a category whose objects represents not only propositions, i.e. closed formulas, but predicates as well (i.e. formulas with vatiables).



            In order to do this one needs some sort of fibered categories (or indexed ones if you prefer).



            The basic idea is the following: instead of having a category of propositions you have for any set of variables $X$, a category of formulas with free variables in $X$, and for every term substitution $sigma colon X to T_Sigma(Y)$ (where by $T_Sigma(Y)$ I mean the set of terms in a signature $Sigma$ and with variables in $Y$) we have a substitution functor between the categories indexed by $X$ and $Y$.



            These data are required to satisfy some additional conditions that are needed to make all work out.



            Without dealing with the details I can tell you this,
            you clearly have and obvious substitution $X to X amalg {bullet}$ which adds a new variable to $X$, this substitution induces a functor between the categories associated to $X$ and $Xamalg{bullet}$ (which I remind are made of formulas with the appropriate variables). This functor basically send every formula with variables in $X$ in the same formula seen as a formula with variables in $X amalg {bullet}$.



            This functor has both a left and right adjoint which are respectively the universal and existential quatifier: these adjoint functors take formulas in $X amalg{bullet}$-variables and give back formulas in $X$-variables.



            Again the details require to know fibered or indexed categories at least, so I am not sure that a full answer can be given here.



            If you are interested to some pointers I suggest to read Bart Jacobs' "Categorical Type Theory" that deals in details with these subject.



            I hope I was able to give you the raw idea, in case you needed any additional clarification please ask.






            share|cite|improve this answer


























              2














              Assuming you are interested only in the Curry-Howard-Lambek type of interpretations of logic in categories then in order to interpret first-order logic in a category cartesian closed categories are not sufficient.



              The problem lies in the fact that you need a category whose objects represents not only propositions, i.e. closed formulas, but predicates as well (i.e. formulas with vatiables).



              In order to do this one needs some sort of fibered categories (or indexed ones if you prefer).



              The basic idea is the following: instead of having a category of propositions you have for any set of variables $X$, a category of formulas with free variables in $X$, and for every term substitution $sigma colon X to T_Sigma(Y)$ (where by $T_Sigma(Y)$ I mean the set of terms in a signature $Sigma$ and with variables in $Y$) we have a substitution functor between the categories indexed by $X$ and $Y$.



              These data are required to satisfy some additional conditions that are needed to make all work out.



              Without dealing with the details I can tell you this,
              you clearly have and obvious substitution $X to X amalg {bullet}$ which adds a new variable to $X$, this substitution induces a functor between the categories associated to $X$ and $Xamalg{bullet}$ (which I remind are made of formulas with the appropriate variables). This functor basically send every formula with variables in $X$ in the same formula seen as a formula with variables in $X amalg {bullet}$.



              This functor has both a left and right adjoint which are respectively the universal and existential quatifier: these adjoint functors take formulas in $X amalg{bullet}$-variables and give back formulas in $X$-variables.



              Again the details require to know fibered or indexed categories at least, so I am not sure that a full answer can be given here.



              If you are interested to some pointers I suggest to read Bart Jacobs' "Categorical Type Theory" that deals in details with these subject.



              I hope I was able to give you the raw idea, in case you needed any additional clarification please ask.






              share|cite|improve this answer
























                2












                2








                2






                Assuming you are interested only in the Curry-Howard-Lambek type of interpretations of logic in categories then in order to interpret first-order logic in a category cartesian closed categories are not sufficient.



                The problem lies in the fact that you need a category whose objects represents not only propositions, i.e. closed formulas, but predicates as well (i.e. formulas with vatiables).



                In order to do this one needs some sort of fibered categories (or indexed ones if you prefer).



                The basic idea is the following: instead of having a category of propositions you have for any set of variables $X$, a category of formulas with free variables in $X$, and for every term substitution $sigma colon X to T_Sigma(Y)$ (where by $T_Sigma(Y)$ I mean the set of terms in a signature $Sigma$ and with variables in $Y$) we have a substitution functor between the categories indexed by $X$ and $Y$.



                These data are required to satisfy some additional conditions that are needed to make all work out.



                Without dealing with the details I can tell you this,
                you clearly have and obvious substitution $X to X amalg {bullet}$ which adds a new variable to $X$, this substitution induces a functor between the categories associated to $X$ and $Xamalg{bullet}$ (which I remind are made of formulas with the appropriate variables). This functor basically send every formula with variables in $X$ in the same formula seen as a formula with variables in $X amalg {bullet}$.



                This functor has both a left and right adjoint which are respectively the universal and existential quatifier: these adjoint functors take formulas in $X amalg{bullet}$-variables and give back formulas in $X$-variables.



                Again the details require to know fibered or indexed categories at least, so I am not sure that a full answer can be given here.



                If you are interested to some pointers I suggest to read Bart Jacobs' "Categorical Type Theory" that deals in details with these subject.



                I hope I was able to give you the raw idea, in case you needed any additional clarification please ask.






                share|cite|improve this answer












                Assuming you are interested only in the Curry-Howard-Lambek type of interpretations of logic in categories then in order to interpret first-order logic in a category cartesian closed categories are not sufficient.



                The problem lies in the fact that you need a category whose objects represents not only propositions, i.e. closed formulas, but predicates as well (i.e. formulas with vatiables).



                In order to do this one needs some sort of fibered categories (or indexed ones if you prefer).



                The basic idea is the following: instead of having a category of propositions you have for any set of variables $X$, a category of formulas with free variables in $X$, and for every term substitution $sigma colon X to T_Sigma(Y)$ (where by $T_Sigma(Y)$ I mean the set of terms in a signature $Sigma$ and with variables in $Y$) we have a substitution functor between the categories indexed by $X$ and $Y$.



                These data are required to satisfy some additional conditions that are needed to make all work out.



                Without dealing with the details I can tell you this,
                you clearly have and obvious substitution $X to X amalg {bullet}$ which adds a new variable to $X$, this substitution induces a functor between the categories associated to $X$ and $Xamalg{bullet}$ (which I remind are made of formulas with the appropriate variables). This functor basically send every formula with variables in $X$ in the same formula seen as a formula with variables in $X amalg {bullet}$.



                This functor has both a left and right adjoint which are respectively the universal and existential quatifier: these adjoint functors take formulas in $X amalg{bullet}$-variables and give back formulas in $X$-variables.



                Again the details require to know fibered or indexed categories at least, so I am not sure that a full answer can be given here.



                If you are interested to some pointers I suggest to read Bart Jacobs' "Categorical Type Theory" that deals in details with these subject.



                I hope I was able to give you the raw idea, in case you needed any additional clarification please ask.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 18 at 15:57









                Giorgio Mossa

                13.8k11749




                13.8k11749






























                    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%2f3003621%2funiversal-quantifiers-in-category-theory%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

                    AnyDesk - Fatal Program Failure

                    How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

                    QoS: MAC-Priority for clients behind a repeater