$T models phi(c_1,ldots,c_n)$ implies $T models forall x_1,ldots,x_n phi(x_1,ldots,x_n)$?












0














Let $L$ be a language and $T$ be an $L$-theory.



Let $L'=L cup C$ where $C$ is a set of new constant symbols.



Suppose $phi(x_1,ldots,x_n)$ is an $L$-formula and $(c_1,ldots,c_n) in C^n$.



(1) Prove that if $T models phi(c_1,ldots,c_n)$ in $L'$ then $T models forall x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$.



How can this statement be true? Shouldn't it be $T models phi(c_1,ldots,c_n)$ in $L'$ implies $T models exists x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$?



Moreover, prove that $T$ admits quantifier elimination as an $L'$-theory if and only if $T$ admits quantifier elimination as an $L$-theory.



I proved the $(Rightarrow)$ part by assuming (1) is true. So is (1) really true? And how can I prove the converse?










share|cite|improve this question






















  • A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
    – Mauro ALLEGRANZA
    Nov 28 '18 at 12:38


















0














Let $L$ be a language and $T$ be an $L$-theory.



Let $L'=L cup C$ where $C$ is a set of new constant symbols.



Suppose $phi(x_1,ldots,x_n)$ is an $L$-formula and $(c_1,ldots,c_n) in C^n$.



(1) Prove that if $T models phi(c_1,ldots,c_n)$ in $L'$ then $T models forall x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$.



How can this statement be true? Shouldn't it be $T models phi(c_1,ldots,c_n)$ in $L'$ implies $T models exists x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$?



Moreover, prove that $T$ admits quantifier elimination as an $L'$-theory if and only if $T$ admits quantifier elimination as an $L$-theory.



I proved the $(Rightarrow)$ part by assuming (1) is true. So is (1) really true? And how can I prove the converse?










share|cite|improve this question






















  • A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
    – Mauro ALLEGRANZA
    Nov 28 '18 at 12:38
















0












0








0







Let $L$ be a language and $T$ be an $L$-theory.



Let $L'=L cup C$ where $C$ is a set of new constant symbols.



Suppose $phi(x_1,ldots,x_n)$ is an $L$-formula and $(c_1,ldots,c_n) in C^n$.



(1) Prove that if $T models phi(c_1,ldots,c_n)$ in $L'$ then $T models forall x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$.



How can this statement be true? Shouldn't it be $T models phi(c_1,ldots,c_n)$ in $L'$ implies $T models exists x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$?



Moreover, prove that $T$ admits quantifier elimination as an $L'$-theory if and only if $T$ admits quantifier elimination as an $L$-theory.



I proved the $(Rightarrow)$ part by assuming (1) is true. So is (1) really true? And how can I prove the converse?










share|cite|improve this question













Let $L$ be a language and $T$ be an $L$-theory.



Let $L'=L cup C$ where $C$ is a set of new constant symbols.



Suppose $phi(x_1,ldots,x_n)$ is an $L$-formula and $(c_1,ldots,c_n) in C^n$.



(1) Prove that if $T models phi(c_1,ldots,c_n)$ in $L'$ then $T models forall x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$.



How can this statement be true? Shouldn't it be $T models phi(c_1,ldots,c_n)$ in $L'$ implies $T models exists x_1,ldots,x_n phi(x_1,ldots,x_n)$ in $L$?



Moreover, prove that $T$ admits quantifier elimination as an $L'$-theory if and only if $T$ admits quantifier elimination as an $L$-theory.



I proved the $(Rightarrow)$ part by assuming (1) is true. So is (1) really true? And how can I prove the converse?







first-order-logic model-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 28 '18 at 12:24









bbw

47038




47038












  • A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
    – Mauro ALLEGRANZA
    Nov 28 '18 at 12:38




















  • A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
    – Mauro ALLEGRANZA
    Nov 28 '18 at 12:38


















A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
– Mauro ALLEGRANZA
Nov 28 '18 at 12:38






A theory is a set of sentences; thus, $T vDash phi$ means that sentence $phi$ is a logical cons of $T$. If $T$ ia an $L$-theory, a model $mathcal M$ for $T$ does not specifiy how to interpret the new constants $c_i$. Thus, $TvDash phi$ means that every model $mathcal M$ of $T$ satisfies also $phi$, whatever the values of the domain $M$ of $mathcal M$ are assigned to the new constants $c_i$.
– Mauro ALLEGRANZA
Nov 28 '18 at 12:38












1 Answer
1






active

oldest

votes


















3














The trick is that you didn't add any axioms about the constants in $C$.



If $T$ is inconsistent, it proves anything, so might as well assume that $T$ is consistent. Take any model of $T$, and any $m_1,ldots,m_n$ in that model, now interpret the constants $c_i$ as $m_i$ and any other constant symbol as $m_1$.



Since $T$ proved that $phi(c_1,ldots,c_n)$, it means that in $M$ (as an $L'$-structure), $phi(m_1,ldots,m_n)$ holds. But this is true for any such $n$-tuple in $M$. In particular, $Mmodelsforall x_1ldotsforall x_nphi(x_1,ldots,x_n)$. And now this is true for all $M$.






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%2f3017085%2ft-models-phic-1-ldots-c-n-implies-t-models-forall-x-1-ldots-x-n-phi%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









    3














    The trick is that you didn't add any axioms about the constants in $C$.



    If $T$ is inconsistent, it proves anything, so might as well assume that $T$ is consistent. Take any model of $T$, and any $m_1,ldots,m_n$ in that model, now interpret the constants $c_i$ as $m_i$ and any other constant symbol as $m_1$.



    Since $T$ proved that $phi(c_1,ldots,c_n)$, it means that in $M$ (as an $L'$-structure), $phi(m_1,ldots,m_n)$ holds. But this is true for any such $n$-tuple in $M$. In particular, $Mmodelsforall x_1ldotsforall x_nphi(x_1,ldots,x_n)$. And now this is true for all $M$.






    share|cite|improve this answer


























      3














      The trick is that you didn't add any axioms about the constants in $C$.



      If $T$ is inconsistent, it proves anything, so might as well assume that $T$ is consistent. Take any model of $T$, and any $m_1,ldots,m_n$ in that model, now interpret the constants $c_i$ as $m_i$ and any other constant symbol as $m_1$.



      Since $T$ proved that $phi(c_1,ldots,c_n)$, it means that in $M$ (as an $L'$-structure), $phi(m_1,ldots,m_n)$ holds. But this is true for any such $n$-tuple in $M$. In particular, $Mmodelsforall x_1ldotsforall x_nphi(x_1,ldots,x_n)$. And now this is true for all $M$.






      share|cite|improve this answer
























        3












        3








        3






        The trick is that you didn't add any axioms about the constants in $C$.



        If $T$ is inconsistent, it proves anything, so might as well assume that $T$ is consistent. Take any model of $T$, and any $m_1,ldots,m_n$ in that model, now interpret the constants $c_i$ as $m_i$ and any other constant symbol as $m_1$.



        Since $T$ proved that $phi(c_1,ldots,c_n)$, it means that in $M$ (as an $L'$-structure), $phi(m_1,ldots,m_n)$ holds. But this is true for any such $n$-tuple in $M$. In particular, $Mmodelsforall x_1ldotsforall x_nphi(x_1,ldots,x_n)$. And now this is true for all $M$.






        share|cite|improve this answer












        The trick is that you didn't add any axioms about the constants in $C$.



        If $T$ is inconsistent, it proves anything, so might as well assume that $T$ is consistent. Take any model of $T$, and any $m_1,ldots,m_n$ in that model, now interpret the constants $c_i$ as $m_i$ and any other constant symbol as $m_1$.



        Since $T$ proved that $phi(c_1,ldots,c_n)$, it means that in $M$ (as an $L'$-structure), $phi(m_1,ldots,m_n)$ holds. But this is true for any such $n$-tuple in $M$. In particular, $Mmodelsforall x_1ldotsforall x_nphi(x_1,ldots,x_n)$. And now this is true for all $M$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 28 '18 at 12:36









        Asaf Karagila

        302k32425756




        302k32425756






























            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%2f3017085%2ft-models-phic-1-ldots-c-n-implies-t-models-forall-x-1-ldots-x-n-phi%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?

            When does type information flow backwards in C++?

            Grease: Live!