If $mathcal{M} equiv mathcal{N}$ then there is some $L$-structure $mathcal{R}$ and elementary embeddings...












0














Let $L$ be a language and $mathcal{M},mathcal{N}$ be $L$-structures. Suppose $mathcal{M}$ and $mathcal{N}$ are elementarily equivalent. Prove that there is some $L$-structure $mathcal{R}$ and elementary embeddings $f:mathcal{M} rightarrow mathcal{R}$ and $g:mathcal{N} rightarrow mathcal{R}$.



My first attempt was to take $mathcal{R}=mathcal{N}$. Then the identity map is an elementary embedding from $mathcal{N}$ to $mathcal{R}$. It remains to show there is an elementary embedding from $mathcal{M}$ to $mathcal{N}$. However, being elementarily equivalent does not imply the existence of elementary embedding. So my method wouldn't work.



Then I have to construct this $L$-structure $mathcal{R}$ so to make it satisfy the desired property. How can I construct it?










share|cite|improve this question


















  • 1




    Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
    – bof
    Nov 27 '18 at 3:40










  • @bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
    – bbw
    Nov 27 '18 at 4:13












  • @bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
    – spaceisdarkgreen
    Nov 27 '18 at 4:20












  • If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
    – bof
    Nov 27 '18 at 4:20










  • @bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
    – bbw
    Nov 27 '18 at 4:26
















0














Let $L$ be a language and $mathcal{M},mathcal{N}$ be $L$-structures. Suppose $mathcal{M}$ and $mathcal{N}$ are elementarily equivalent. Prove that there is some $L$-structure $mathcal{R}$ and elementary embeddings $f:mathcal{M} rightarrow mathcal{R}$ and $g:mathcal{N} rightarrow mathcal{R}$.



My first attempt was to take $mathcal{R}=mathcal{N}$. Then the identity map is an elementary embedding from $mathcal{N}$ to $mathcal{R}$. It remains to show there is an elementary embedding from $mathcal{M}$ to $mathcal{N}$. However, being elementarily equivalent does not imply the existence of elementary embedding. So my method wouldn't work.



Then I have to construct this $L$-structure $mathcal{R}$ so to make it satisfy the desired property. How can I construct it?










share|cite|improve this question


















  • 1




    Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
    – bof
    Nov 27 '18 at 3:40










  • @bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
    – bbw
    Nov 27 '18 at 4:13












  • @bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
    – spaceisdarkgreen
    Nov 27 '18 at 4:20












  • If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
    – bof
    Nov 27 '18 at 4:20










  • @bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
    – bbw
    Nov 27 '18 at 4:26














0












0








0


1





Let $L$ be a language and $mathcal{M},mathcal{N}$ be $L$-structures. Suppose $mathcal{M}$ and $mathcal{N}$ are elementarily equivalent. Prove that there is some $L$-structure $mathcal{R}$ and elementary embeddings $f:mathcal{M} rightarrow mathcal{R}$ and $g:mathcal{N} rightarrow mathcal{R}$.



My first attempt was to take $mathcal{R}=mathcal{N}$. Then the identity map is an elementary embedding from $mathcal{N}$ to $mathcal{R}$. It remains to show there is an elementary embedding from $mathcal{M}$ to $mathcal{N}$. However, being elementarily equivalent does not imply the existence of elementary embedding. So my method wouldn't work.



Then I have to construct this $L$-structure $mathcal{R}$ so to make it satisfy the desired property. How can I construct it?










share|cite|improve this question













Let $L$ be a language and $mathcal{M},mathcal{N}$ be $L$-structures. Suppose $mathcal{M}$ and $mathcal{N}$ are elementarily equivalent. Prove that there is some $L$-structure $mathcal{R}$ and elementary embeddings $f:mathcal{M} rightarrow mathcal{R}$ and $g:mathcal{N} rightarrow mathcal{R}$.



My first attempt was to take $mathcal{R}=mathcal{N}$. Then the identity map is an elementary embedding from $mathcal{N}$ to $mathcal{R}$. It remains to show there is an elementary embedding from $mathcal{M}$ to $mathcal{N}$. However, being elementarily equivalent does not imply the existence of elementary embedding. So my method wouldn't work.



Then I have to construct this $L$-structure $mathcal{R}$ so to make it satisfy the desired property. How can I construct it?







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 27 '18 at 2:13









bbw

47038




47038








  • 1




    Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
    – bof
    Nov 27 '18 at 3:40










  • @bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
    – bbw
    Nov 27 '18 at 4:13












  • @bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
    – spaceisdarkgreen
    Nov 27 '18 at 4:20












  • If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
    – bof
    Nov 27 '18 at 4:20










  • @bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
    – bbw
    Nov 27 '18 at 4:26














  • 1




    Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
    – bof
    Nov 27 '18 at 3:40










  • @bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
    – bbw
    Nov 27 '18 at 4:13












  • @bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
    – spaceisdarkgreen
    Nov 27 '18 at 4:20












  • If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
    – bof
    Nov 27 '18 at 4:20










  • @bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
    – bbw
    Nov 27 '18 at 4:26








1




1




Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
– bof
Nov 27 '18 at 3:40




Hint. Expand the language by giving each element of $mathcal M$ and each element of $mathcal N$ a name. Let $T_1$ and $T_2$ be the theories of $mathcal M$ and $mathcal N$ in the expanded language, and let $T=T_1cup T_2$. Use elementary equivalence of $mathcal M$ and $mathcal N$ to show that each finite subset of $T$ is satisfiable; conclude by compactness that $T$ is satisfiable; let $mathbb R$ be a model of $T$; observe that $mathcal M$ and $mathcal N$ are elementarily embeddable in $mathcal R$.
– bof
Nov 27 '18 at 3:40












@bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
– bbw
Nov 27 '18 at 4:13






@bof, I have a maybe unrelated question: does $Th(mathcal{M}) = Th(mathcal{N})$ imply $|M|=|N|$?
– bbw
Nov 27 '18 at 4:13














@bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
– spaceisdarkgreen
Nov 27 '18 at 4:20






@bbw No, Lowenheim-Skolem says in many cases, there will be models of $Th(mathcal M)$ of any infinite cardinality and all models of a complete theory have the same theory (namely that complete theory).
– spaceisdarkgreen
Nov 27 '18 at 4:20














If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
– bof
Nov 27 '18 at 4:20




If $|M|$ means the cardinality of the underlying set of $mathcal M$, not necessarily.
– bof
Nov 27 '18 at 4:20












@bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
– bbw
Nov 27 '18 at 4:26




@bof, by "expand the language", do you mean taking $L_1=L cup M$ and $L_2=L cup N$ or you mean taking $L'=L cup M cup N$?
– bbw
Nov 27 '18 at 4:26










0






active

oldest

votes











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%2f3015237%2fif-mathcalm-equiv-mathcaln-then-there-is-some-l-structure-mathcalr%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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%2f3015237%2fif-mathcalm-equiv-mathcaln-then-there-is-some-l-structure-mathcalr%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

Plaza Victoria

Puebla de Zaragoza

Musa