Prove that $mathcal{A}preceq mathcal{B}$.












2














Can someone check whether my solution is okay?




If $mathcal{A}subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$, prove that $mathcal{A}preceq mathcal{B}$.




Let $mathcal{A} subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$. Then for any $mathcal{L}$-formulas $phi$ and assignments $alpha$, $mathcal{A}models phi[alpha]$ if and only if $mathcal{C}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$. Then $mathcal{A}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$ and by definition of substructures, $Asubseteq B$. Then $mathcal{A}preceq mathcal{B}$.










share|cite|improve this question






















  • Can you define $preceq, mathcal L$-formula, assignment and $models$?
    – Jimmy R.
    Nov 29 '18 at 2:04








  • 4




    @Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:08






  • 3




    Yes, the proof is fine.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:09






  • 3




    The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
    – Henning Makholm
    Nov 29 '18 at 2:21












  • @HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
    – numericalorange
    Nov 29 '18 at 2:23
















2














Can someone check whether my solution is okay?




If $mathcal{A}subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$, prove that $mathcal{A}preceq mathcal{B}$.




Let $mathcal{A} subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$. Then for any $mathcal{L}$-formulas $phi$ and assignments $alpha$, $mathcal{A}models phi[alpha]$ if and only if $mathcal{C}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$. Then $mathcal{A}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$ and by definition of substructures, $Asubseteq B$. Then $mathcal{A}preceq mathcal{B}$.










share|cite|improve this question






















  • Can you define $preceq, mathcal L$-formula, assignment and $models$?
    – Jimmy R.
    Nov 29 '18 at 2:04








  • 4




    @Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:08






  • 3




    Yes, the proof is fine.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:09






  • 3




    The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
    – Henning Makholm
    Nov 29 '18 at 2:21












  • @HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
    – numericalorange
    Nov 29 '18 at 2:23














2












2








2







Can someone check whether my solution is okay?




If $mathcal{A}subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$, prove that $mathcal{A}preceq mathcal{B}$.




Let $mathcal{A} subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$. Then for any $mathcal{L}$-formulas $phi$ and assignments $alpha$, $mathcal{A}models phi[alpha]$ if and only if $mathcal{C}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$. Then $mathcal{A}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$ and by definition of substructures, $Asubseteq B$. Then $mathcal{A}preceq mathcal{B}$.










share|cite|improve this question













Can someone check whether my solution is okay?




If $mathcal{A}subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$, prove that $mathcal{A}preceq mathcal{B}$.




Let $mathcal{A} subseteq mathcal{B}$, $mathcal{A}preceq mathcal{C}$, and $mathcal{B}preceq mathcal{C}$. Then for any $mathcal{L}$-formulas $phi$ and assignments $alpha$, $mathcal{A}models phi[alpha]$ if and only if $mathcal{C}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$. Then $mathcal{A}models phi[alpha]$ if and only if $mathcal{B}models phi[alpha]$ and by definition of substructures, $Asubseteq B$. Then $mathcal{A}preceq mathcal{B}$.







proof-verification 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 29 '18 at 2:02









numericalorange

1,726311




1,726311












  • Can you define $preceq, mathcal L$-formula, assignment and $models$?
    – Jimmy R.
    Nov 29 '18 at 2:04








  • 4




    @Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:08






  • 3




    Yes, the proof is fine.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:09






  • 3




    The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
    – Henning Makholm
    Nov 29 '18 at 2:21












  • @HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
    – numericalorange
    Nov 29 '18 at 2:23


















  • Can you define $preceq, mathcal L$-formula, assignment and $models$?
    – Jimmy R.
    Nov 29 '18 at 2:04








  • 4




    @Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:08






  • 3




    Yes, the proof is fine.
    – Andrés E. Caicedo
    Nov 29 '18 at 2:09






  • 3




    The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
    – Henning Makholm
    Nov 29 '18 at 2:21












  • @HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
    – numericalorange
    Nov 29 '18 at 2:23
















Can you define $preceq, mathcal L$-formula, assignment and $models$?
– Jimmy R.
Nov 29 '18 at 2:04






Can you define $preceq, mathcal L$-formula, assignment and $models$?
– Jimmy R.
Nov 29 '18 at 2:04






4




4




@Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
– Andrés E. Caicedo
Nov 29 '18 at 2:08




@Jimmy That seems unreasonable; it would make the question too long. These are basic model-theoretic concepts.
– Andrés E. Caicedo
Nov 29 '18 at 2:08




3




3




Yes, the proof is fine.
– Andrés E. Caicedo
Nov 29 '18 at 2:09




Yes, the proof is fine.
– Andrés E. Caicedo
Nov 29 '18 at 2:09




3




3




The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
– Henning Makholm
Nov 29 '18 at 2:21






The proof makes sense if $preceq$ stands for "is an elementary substructure of". I think it would be reasonable to at least say explicitly either that this is what $preceq$ means here, or to say explicitly which kinds of things the letters $mathcal A$, $mathcal B$, $mathcal C$ range over in the quoted goal.
– Henning Makholm
Nov 29 '18 at 2:21














@HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
– numericalorange
Nov 29 '18 at 2:23




@HenningMakholm I see. Yes, it stands for elementary substructure, and $mathcal{A,B,C}$ are just structures for a language! I am not sure about the range...
– numericalorange
Nov 29 '18 at 2:23










1 Answer
1






active

oldest

votes


















1














The proof seems okay. One point you glossed over a little bit more than you should have: when you choose $alpha$, you should specify that it is an arbitrary assignment in $A$, and later on, when you use $Bpreceq C$, you should deduce that it is therefore an assignment in $B$ (so you can apply $Bpreceq C$). Just make sure you apply the hypothesis directly, and how you apply it. That should remove all doubt about correctness.






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%2f3018049%2fprove-that-mathcala-preceq-mathcalb%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









    1














    The proof seems okay. One point you glossed over a little bit more than you should have: when you choose $alpha$, you should specify that it is an arbitrary assignment in $A$, and later on, when you use $Bpreceq C$, you should deduce that it is therefore an assignment in $B$ (so you can apply $Bpreceq C$). Just make sure you apply the hypothesis directly, and how you apply it. That should remove all doubt about correctness.






    share|cite|improve this answer


























      1














      The proof seems okay. One point you glossed over a little bit more than you should have: when you choose $alpha$, you should specify that it is an arbitrary assignment in $A$, and later on, when you use $Bpreceq C$, you should deduce that it is therefore an assignment in $B$ (so you can apply $Bpreceq C$). Just make sure you apply the hypothesis directly, and how you apply it. That should remove all doubt about correctness.






      share|cite|improve this answer
























        1












        1








        1






        The proof seems okay. One point you glossed over a little bit more than you should have: when you choose $alpha$, you should specify that it is an arbitrary assignment in $A$, and later on, when you use $Bpreceq C$, you should deduce that it is therefore an assignment in $B$ (so you can apply $Bpreceq C$). Just make sure you apply the hypothesis directly, and how you apply it. That should remove all doubt about correctness.






        share|cite|improve this answer












        The proof seems okay. One point you glossed over a little bit more than you should have: when you choose $alpha$, you should specify that it is an arbitrary assignment in $A$, and later on, when you use $Bpreceq C$, you should deduce that it is therefore an assignment in $B$ (so you can apply $Bpreceq C$). Just make sure you apply the hypothesis directly, and how you apply it. That should remove all doubt about correctness.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 1 '18 at 19:40









        tomasz

        23.4k23278




        23.4k23278






























            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%2f3018049%2fprove-that-mathcala-preceq-mathcalb%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++?