Existence of saturated models of a theory.
$begingroup$
In Tent, Ziegler: A Course in Model Theory it is stated on page 89, that
Saturated structures need not exist (think about why not), but
by considering special models instead, we can preserve many of the important
properties – and prove their existence.
I do not see why this statement holds in this generality. Finite structures are always saturated, so consider a (complete) $L$-theory $T$ with infinite models. By Löwenheim-Skolem we find a model $MvDash T$ with $|M|=kappageq |T|^+$. Then for $Asubseteq M$ with $|A|leq|T|$ we have $|S_n^M(A)|leq 2^{|T|}$. If we assume the continuum hypothesis $2^{|T|}=|T|^+$, then we may add at most $|T|^+=2^{|T|}$ additional elements to realize all omitted types of $S_n^M(A)$ to the structure $M$ and by compactness get an elementary extension $Nsucc M$ of the same cardinality. So it should always be possible to find a saturated model at some sufficiently large cardinality in this setting.
Is my guess that it is about the continuum hypothesis correct or am I missing the point?
set-theory model-theory
$endgroup$
add a comment |
$begingroup$
In Tent, Ziegler: A Course in Model Theory it is stated on page 89, that
Saturated structures need not exist (think about why not), but
by considering special models instead, we can preserve many of the important
properties – and prove their existence.
I do not see why this statement holds in this generality. Finite structures are always saturated, so consider a (complete) $L$-theory $T$ with infinite models. By Löwenheim-Skolem we find a model $MvDash T$ with $|M|=kappageq |T|^+$. Then for $Asubseteq M$ with $|A|leq|T|$ we have $|S_n^M(A)|leq 2^{|T|}$. If we assume the continuum hypothesis $2^{|T|}=|T|^+$, then we may add at most $|T|^+=2^{|T|}$ additional elements to realize all omitted types of $S_n^M(A)$ to the structure $M$ and by compactness get an elementary extension $Nsucc M$ of the same cardinality. So it should always be possible to find a saturated model at some sufficiently large cardinality in this setting.
Is my guess that it is about the continuum hypothesis correct or am I missing the point?
set-theory model-theory
$endgroup$
add a comment |
$begingroup$
In Tent, Ziegler: A Course in Model Theory it is stated on page 89, that
Saturated structures need not exist (think about why not), but
by considering special models instead, we can preserve many of the important
properties – and prove their existence.
I do not see why this statement holds in this generality. Finite structures are always saturated, so consider a (complete) $L$-theory $T$ with infinite models. By Löwenheim-Skolem we find a model $MvDash T$ with $|M|=kappageq |T|^+$. Then for $Asubseteq M$ with $|A|leq|T|$ we have $|S_n^M(A)|leq 2^{|T|}$. If we assume the continuum hypothesis $2^{|T|}=|T|^+$, then we may add at most $|T|^+=2^{|T|}$ additional elements to realize all omitted types of $S_n^M(A)$ to the structure $M$ and by compactness get an elementary extension $Nsucc M$ of the same cardinality. So it should always be possible to find a saturated model at some sufficiently large cardinality in this setting.
Is my guess that it is about the continuum hypothesis correct or am I missing the point?
set-theory model-theory
$endgroup$
In Tent, Ziegler: A Course in Model Theory it is stated on page 89, that
Saturated structures need not exist (think about why not), but
by considering special models instead, we can preserve many of the important
properties – and prove their existence.
I do not see why this statement holds in this generality. Finite structures are always saturated, so consider a (complete) $L$-theory $T$ with infinite models. By Löwenheim-Skolem we find a model $MvDash T$ with $|M|=kappageq |T|^+$. Then for $Asubseteq M$ with $|A|leq|T|$ we have $|S_n^M(A)|leq 2^{|T|}$. If we assume the continuum hypothesis $2^{|T|}=|T|^+$, then we may add at most $|T|^+=2^{|T|}$ additional elements to realize all omitted types of $S_n^M(A)$ to the structure $M$ and by compactness get an elementary extension $Nsucc M$ of the same cardinality. So it should always be possible to find a saturated model at some sufficiently large cardinality in this setting.
Is my guess that it is about the continuum hypothesis correct or am I missing the point?
set-theory model-theory
set-theory model-theory
edited Dec 12 '18 at 16:29
Andrés E. Caicedo
65.8k8160251
65.8k8160251
asked Dec 11 '18 at 20:23
ZikrunumeaZikrunumea
709
709
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Your argument is correct, assuming the instance $2^{|T|} = |T|^+$ of the generalized continuum hypothesis.
More generally, you can prove that an arbitrary theory $T$ has a saturated model of cardinality $kappa$ if $kappa geq |T|^+$, $kappa$ is regular, and $kappa^{<kappa} = kappa$. Note that:
- If $kappa = lambda^+ = 2^{lambda}$ for some cardinal $lambdageq |T|$, then $kappa$ satisfies the hypothesis.
- If $kappa$ is strongly inaccessible (and greater than $|T|$), then $kappa$ satisfies the hypotheses.
But both of these hypotheses on $kappa$ go beyond ZFC.
It's also possible to prove that if $T$ is stable in $kappageq |T|$ (meaning that for any $Mmodels T$ and $Asubseteq M$ with $|A|leq kappa$, $|S_n^M(A)| = kappa$), then $T$ has a saturated model of cardinality $kappa$. We say that $T$ is stable if it is stable in some cardinal $kappageq |T|$, and (of course) not every theory is stable.
When Tent and Ziegler say "saturated structures need not exist", they mean "we can't prove in ZFC that every theory has a saturated model". Indeed, it's consistent with ZFC that no unstable theory has a saturated model. For example, it's consistent that the theory $text{Th}(mathbb{R};+,-,cdot,0,1)$ of real closed fields has no saturated models.
$endgroup$
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035767%2fexistence-of-saturated-models-of-a-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
$begingroup$
Your argument is correct, assuming the instance $2^{|T|} = |T|^+$ of the generalized continuum hypothesis.
More generally, you can prove that an arbitrary theory $T$ has a saturated model of cardinality $kappa$ if $kappa geq |T|^+$, $kappa$ is regular, and $kappa^{<kappa} = kappa$. Note that:
- If $kappa = lambda^+ = 2^{lambda}$ for some cardinal $lambdageq |T|$, then $kappa$ satisfies the hypothesis.
- If $kappa$ is strongly inaccessible (and greater than $|T|$), then $kappa$ satisfies the hypotheses.
But both of these hypotheses on $kappa$ go beyond ZFC.
It's also possible to prove that if $T$ is stable in $kappageq |T|$ (meaning that for any $Mmodels T$ and $Asubseteq M$ with $|A|leq kappa$, $|S_n^M(A)| = kappa$), then $T$ has a saturated model of cardinality $kappa$. We say that $T$ is stable if it is stable in some cardinal $kappageq |T|$, and (of course) not every theory is stable.
When Tent and Ziegler say "saturated structures need not exist", they mean "we can't prove in ZFC that every theory has a saturated model". Indeed, it's consistent with ZFC that no unstable theory has a saturated model. For example, it's consistent that the theory $text{Th}(mathbb{R};+,-,cdot,0,1)$ of real closed fields has no saturated models.
$endgroup$
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
add a comment |
$begingroup$
Your argument is correct, assuming the instance $2^{|T|} = |T|^+$ of the generalized continuum hypothesis.
More generally, you can prove that an arbitrary theory $T$ has a saturated model of cardinality $kappa$ if $kappa geq |T|^+$, $kappa$ is regular, and $kappa^{<kappa} = kappa$. Note that:
- If $kappa = lambda^+ = 2^{lambda}$ for some cardinal $lambdageq |T|$, then $kappa$ satisfies the hypothesis.
- If $kappa$ is strongly inaccessible (and greater than $|T|$), then $kappa$ satisfies the hypotheses.
But both of these hypotheses on $kappa$ go beyond ZFC.
It's also possible to prove that if $T$ is stable in $kappageq |T|$ (meaning that for any $Mmodels T$ and $Asubseteq M$ with $|A|leq kappa$, $|S_n^M(A)| = kappa$), then $T$ has a saturated model of cardinality $kappa$. We say that $T$ is stable if it is stable in some cardinal $kappageq |T|$, and (of course) not every theory is stable.
When Tent and Ziegler say "saturated structures need not exist", they mean "we can't prove in ZFC that every theory has a saturated model". Indeed, it's consistent with ZFC that no unstable theory has a saturated model. For example, it's consistent that the theory $text{Th}(mathbb{R};+,-,cdot,0,1)$ of real closed fields has no saturated models.
$endgroup$
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
add a comment |
$begingroup$
Your argument is correct, assuming the instance $2^{|T|} = |T|^+$ of the generalized continuum hypothesis.
More generally, you can prove that an arbitrary theory $T$ has a saturated model of cardinality $kappa$ if $kappa geq |T|^+$, $kappa$ is regular, and $kappa^{<kappa} = kappa$. Note that:
- If $kappa = lambda^+ = 2^{lambda}$ for some cardinal $lambdageq |T|$, then $kappa$ satisfies the hypothesis.
- If $kappa$ is strongly inaccessible (and greater than $|T|$), then $kappa$ satisfies the hypotheses.
But both of these hypotheses on $kappa$ go beyond ZFC.
It's also possible to prove that if $T$ is stable in $kappageq |T|$ (meaning that for any $Mmodels T$ and $Asubseteq M$ with $|A|leq kappa$, $|S_n^M(A)| = kappa$), then $T$ has a saturated model of cardinality $kappa$. We say that $T$ is stable if it is stable in some cardinal $kappageq |T|$, and (of course) not every theory is stable.
When Tent and Ziegler say "saturated structures need not exist", they mean "we can't prove in ZFC that every theory has a saturated model". Indeed, it's consistent with ZFC that no unstable theory has a saturated model. For example, it's consistent that the theory $text{Th}(mathbb{R};+,-,cdot,0,1)$ of real closed fields has no saturated models.
$endgroup$
Your argument is correct, assuming the instance $2^{|T|} = |T|^+$ of the generalized continuum hypothesis.
More generally, you can prove that an arbitrary theory $T$ has a saturated model of cardinality $kappa$ if $kappa geq |T|^+$, $kappa$ is regular, and $kappa^{<kappa} = kappa$. Note that:
- If $kappa = lambda^+ = 2^{lambda}$ for some cardinal $lambdageq |T|$, then $kappa$ satisfies the hypothesis.
- If $kappa$ is strongly inaccessible (and greater than $|T|$), then $kappa$ satisfies the hypotheses.
But both of these hypotheses on $kappa$ go beyond ZFC.
It's also possible to prove that if $T$ is stable in $kappageq |T|$ (meaning that for any $Mmodels T$ and $Asubseteq M$ with $|A|leq kappa$, $|S_n^M(A)| = kappa$), then $T$ has a saturated model of cardinality $kappa$. We say that $T$ is stable if it is stable in some cardinal $kappageq |T|$, and (of course) not every theory is stable.
When Tent and Ziegler say "saturated structures need not exist", they mean "we can't prove in ZFC that every theory has a saturated model". Indeed, it's consistent with ZFC that no unstable theory has a saturated model. For example, it's consistent that the theory $text{Th}(mathbb{R};+,-,cdot,0,1)$ of real closed fields has no saturated models.
edited Dec 12 '18 at 0:17
answered Dec 11 '18 at 22:12
Alex KruckmanAlex Kruckman
28.3k32758
28.3k32758
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
add a comment |
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
When I took my first (and really only) course in model theory, we heard the same thing "these assumptions go beyond ZFC". And that sort of scared me at the time. Like "Oh no, it's stuff you cannot prove! Inaccessible blasphemy!!!", but later it turns out that it's not that. It's something different. It's something I can't put my finger on, but the sentence "goes beyond ZFC" is scary, whereas ZFC+GCH is really not.
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 0:03
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
@AsafKaragila Right, I think it's important to emphasize that you need some set theoretic assumptions to construct saturated models, but that these assumptions are relatively tame: GCH or strongly inaccessible cardinals. Of course, the level to which these assumptions seem scary vs tame depends on how comfortable you are with set theory, and (to some extent) your view on the philosophy of mathematics. Personally, I'd rather assume a proper class of inaccessibles than assume GCH.
$endgroup$
– Alex Kruckman
Dec 12 '18 at 0:15
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
On the other hand, to ensure that some theories have no saturated models you need a global failure of GCH, an assumption which has some large cardinal strength.
$endgroup$
– Andrés E. Caicedo
Dec 12 '18 at 2:12
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
$begingroup$
Alex, of course it's important. But the way it was presented as "going beyond ZFC" is a bit scary to someone who is new to model theory and/or set theory. It puts a mystic twist on this, as something we can't really prove. And yes, it's something we can't really prove, but the point is that this can be better presented by model theorists. :-)
$endgroup$
– Asaf Karagila♦
Dec 12 '18 at 7:34
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035767%2fexistence-of-saturated-models-of-a-theory%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
