Proving that $langlemathbb{R}-{7},<rangle$ is an elementary substructure of $langlemathbb{R},<rangle$












1












$begingroup$



Prove that $langlemathbb{R}-{7},<rangle$ is an elementary substructure of $langlemathbb{R},<rangle$.




What I thought I should do is to use induction on statements to prove that. Any easier way to acomplish that?










share|cite|improve this question











$endgroup$












  • $begingroup$
    If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
    $endgroup$
    – tomasz
    Jan 7 at 10:36
















1












$begingroup$



Prove that $langlemathbb{R}-{7},<rangle$ is an elementary substructure of $langlemathbb{R},<rangle$.




What I thought I should do is to use induction on statements to prove that. Any easier way to acomplish that?










share|cite|improve this question











$endgroup$












  • $begingroup$
    If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
    $endgroup$
    – tomasz
    Jan 7 at 10:36














1












1








1





$begingroup$



Prove that $langlemathbb{R}-{7},<rangle$ is an elementary substructure of $langlemathbb{R},<rangle$.




What I thought I should do is to use induction on statements to prove that. Any easier way to acomplish that?










share|cite|improve this question











$endgroup$





Prove that $langlemathbb{R}-{7},<rangle$ is an elementary substructure of $langlemathbb{R},<rangle$.




What I thought I should do is to use induction on statements to prove that. Any easier way to acomplish that?







logic model-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 5 at 13:23









6005

36.3k751125




36.3k751125










asked Jan 5 at 11:57









GytGyt

547419




547419












  • $begingroup$
    If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
    $endgroup$
    – tomasz
    Jan 7 at 10:36


















  • $begingroup$
    If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
    $endgroup$
    – tomasz
    Jan 7 at 10:36
















$begingroup$
If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
$endgroup$
– tomasz
Jan 7 at 10:36




$begingroup$
If you know that dense linear orderings have quantifier elimination, then it is an immediate consequence.
$endgroup$
– tomasz
Jan 7 at 10:36










1 Answer
1






active

oldest

votes


















6












$begingroup$

An easier way is an application of the following "sufficient condition"-style test.




If $mathfrak{A}=langle A,ldotsrangle$ is a substructure of $mathfrak{B}=langle B,ldotsrangle$ and, for any finite subset $A'$ of $A$ and any $bin B$, there is an automorphism $f$ of $mathfrak{B}$ such that $f(a)=a$ for any $ain A'$, and $f(b)in A$, then $mathfrak{A}$ is an elementary substructure of $mathfrak{B}$.




(Which may appear in your prerequisite course, maybe in somewhat stronger form, and is usually proven using Tarski–Vaught criterion). It is easy to exhibit an $f$ in your setup.






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%2f3062650%2fproving-that-langle-mathbbr-7-rangle-is-an-elementary-substructure-of%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









    6












    $begingroup$

    An easier way is an application of the following "sufficient condition"-style test.




    If $mathfrak{A}=langle A,ldotsrangle$ is a substructure of $mathfrak{B}=langle B,ldotsrangle$ and, for any finite subset $A'$ of $A$ and any $bin B$, there is an automorphism $f$ of $mathfrak{B}$ such that $f(a)=a$ for any $ain A'$, and $f(b)in A$, then $mathfrak{A}$ is an elementary substructure of $mathfrak{B}$.




    (Which may appear in your prerequisite course, maybe in somewhat stronger form, and is usually proven using Tarski–Vaught criterion). It is easy to exhibit an $f$ in your setup.






    share|cite|improve this answer











    $endgroup$


















      6












      $begingroup$

      An easier way is an application of the following "sufficient condition"-style test.




      If $mathfrak{A}=langle A,ldotsrangle$ is a substructure of $mathfrak{B}=langle B,ldotsrangle$ and, for any finite subset $A'$ of $A$ and any $bin B$, there is an automorphism $f$ of $mathfrak{B}$ such that $f(a)=a$ for any $ain A'$, and $f(b)in A$, then $mathfrak{A}$ is an elementary substructure of $mathfrak{B}$.




      (Which may appear in your prerequisite course, maybe in somewhat stronger form, and is usually proven using Tarski–Vaught criterion). It is easy to exhibit an $f$ in your setup.






      share|cite|improve this answer











      $endgroup$
















        6












        6








        6





        $begingroup$

        An easier way is an application of the following "sufficient condition"-style test.




        If $mathfrak{A}=langle A,ldotsrangle$ is a substructure of $mathfrak{B}=langle B,ldotsrangle$ and, for any finite subset $A'$ of $A$ and any $bin B$, there is an automorphism $f$ of $mathfrak{B}$ such that $f(a)=a$ for any $ain A'$, and $f(b)in A$, then $mathfrak{A}$ is an elementary substructure of $mathfrak{B}$.




        (Which may appear in your prerequisite course, maybe in somewhat stronger form, and is usually proven using Tarski–Vaught criterion). It is easy to exhibit an $f$ in your setup.






        share|cite|improve this answer











        $endgroup$



        An easier way is an application of the following "sufficient condition"-style test.




        If $mathfrak{A}=langle A,ldotsrangle$ is a substructure of $mathfrak{B}=langle B,ldotsrangle$ and, for any finite subset $A'$ of $A$ and any $bin B$, there is an automorphism $f$ of $mathfrak{B}$ such that $f(a)=a$ for any $ain A'$, and $f(b)in A$, then $mathfrak{A}$ is an elementary substructure of $mathfrak{B}$.




        (Which may appear in your prerequisite course, maybe in somewhat stronger form, and is usually proven using Tarski–Vaught criterion). It is easy to exhibit an $f$ in your setup.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 5 at 12:40

























        answered Jan 5 at 12:35









        metamorphymetamorphy

        3,7021621




        3,7021621






























            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%2f3062650%2fproving-that-langle-mathbbr-7-rangle-is-an-elementary-substructure-of%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

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei