Indiscernible sequences in countable complete theoryfinding n-typesProof of Lowenheim-Skolem theoremClassification of modelsModels of $T_forallexists$ embed in a existentially closed extension model of $T$.The unique model of cardinal $kappa$ of a $kappa$-categorical countable theory is saturated.In a stable theory a Indiscernible sequences are Indiscernible setsDescribing ring properties in terms of infinitary sentences (Hodges, Model Theory, 2.2-9)Are there any non-trivially 'potentially categorical' first order theories?Many set theory and model theory questions.How can a formula have nontrivial alternation number?
Assassin's bullet with mercury
What's the in-universe reasoning behind sorcerers needing material components?
Can a virus destroy the BIOS of a modern computer?
Avoiding direct proof while writing proof by induction
Unlock My Phone! February 2018
Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?
Plagiarism or not?
Detention in 1997
Is "remove commented out code" correct English?
iPad being using in wall mount battery swollen
How did the Super Star Destroyer Executor get destroyed exactly?
How would I stat a creature to be immune to everything but the Magic Missile spell? (just for fun)
Examples of smooth manifolds admitting inbetween one and a continuum of complex structures
Forgetting the musical notes while performing in concert
What about the virus in 12 Monkeys?
Should I tell management that I intend to leave due to bad software development practices?
Is there a hemisphere-neutral way of specifying a season?
How can saying a song's name be a copyright violation?
Expand and Contract
How to compactly explain secondary and tertiary characters without resorting to stereotypes?
Why is consensus so controversial in Britain?
What exploit Are these user agents trying to use?
How to show a landlord what we have in savings?
Why didn't Boeing produce its own regional jet?
Indiscernible sequences in countable complete theory
finding n-typesProof of Lowenheim-Skolem theoremClassification of modelsModels of $T_forallexists$ embed in a existentially closed extension model of $T$.The unique model of cardinal $kappa$ of a $kappa$-categorical countable theory is saturated.In a stable theory a Indiscernible sequences are Indiscernible setsDescribing ring properties in terms of infinitary sentences (Hodges, Model Theory, 2.2-9)Are there any non-trivially 'potentially categorical' first order theories?Many set theory and model theory questions.How can a formula have nontrivial alternation number?
$begingroup$
Given complete $T$ in countable language, prove for any $kappa >omega$, $exists mathcalMmodels T$ such that $forall AsubseteqmathcalM, mathcalM$ realizes at most $|A|+omega$ types n $S^mathcalM_n(A)$.
Proof goes like this(in Lecture note I'm using). Take $mathcalM$ indiscernible hull of indiscernible $I$ cardinality of $kappa$. Here $mathcalM$ is model of skolemization of $T$ in corresponding language $mathcalL^*$. Given $AsubseteqmathcalM$, $ain A$ can be written as $a=t^mathcalM(c_a)$ where $c_a in I$. take $J=cup_ain A c_a$. then we can show |types over $A$| $leq$|types over J| in $mathcalM$. So it is enough to show latter one$leq |A|+omega$. Now define equivalence relation as follows:
$forall_n<omegaforallbarc,bardin[I]^n barc simbardLeftrightarrow forall_1leq kleq nforall ein J, (c_k<eleftrightarrow d_k<e) wedge (c_k=eleftrightarrow d_k=e)$
where $barc=(c_1,...,c_n),bard=(d_1,...,d_n)$ increasing sequence in $[I]^n$. I'm proving for any term $t(barx)inmathcalL^*$ having n-variables, $barcsimbard$ implies $tp_mathcalM(t^M(barc)/J)=tp_mathcalM(t^M(bard)/J)$. In my note, it is written that "$tp_mathcalM(barc/J)=tp_mathcalM(bard/J)$ implies equality above". but I could prove the former one but I don't know how to get the latter one from first one..
model-theory
$endgroup$
add a comment |
$begingroup$
Given complete $T$ in countable language, prove for any $kappa >omega$, $exists mathcalMmodels T$ such that $forall AsubseteqmathcalM, mathcalM$ realizes at most $|A|+omega$ types n $S^mathcalM_n(A)$.
Proof goes like this(in Lecture note I'm using). Take $mathcalM$ indiscernible hull of indiscernible $I$ cardinality of $kappa$. Here $mathcalM$ is model of skolemization of $T$ in corresponding language $mathcalL^*$. Given $AsubseteqmathcalM$, $ain A$ can be written as $a=t^mathcalM(c_a)$ where $c_a in I$. take $J=cup_ain A c_a$. then we can show |types over $A$| $leq$|types over J| in $mathcalM$. So it is enough to show latter one$leq |A|+omega$. Now define equivalence relation as follows:
$forall_n<omegaforallbarc,bardin[I]^n barc simbardLeftrightarrow forall_1leq kleq nforall ein J, (c_k<eleftrightarrow d_k<e) wedge (c_k=eleftrightarrow d_k=e)$
where $barc=(c_1,...,c_n),bard=(d_1,...,d_n)$ increasing sequence in $[I]^n$. I'm proving for any term $t(barx)inmathcalL^*$ having n-variables, $barcsimbard$ implies $tp_mathcalM(t^M(barc)/J)=tp_mathcalM(t^M(bard)/J)$. In my note, it is written that "$tp_mathcalM(barc/J)=tp_mathcalM(bard/J)$ implies equality above". but I could prove the former one but I don't know how to get the latter one from first one..
model-theory
$endgroup$
add a comment |
$begingroup$
Given complete $T$ in countable language, prove for any $kappa >omega$, $exists mathcalMmodels T$ such that $forall AsubseteqmathcalM, mathcalM$ realizes at most $|A|+omega$ types n $S^mathcalM_n(A)$.
Proof goes like this(in Lecture note I'm using). Take $mathcalM$ indiscernible hull of indiscernible $I$ cardinality of $kappa$. Here $mathcalM$ is model of skolemization of $T$ in corresponding language $mathcalL^*$. Given $AsubseteqmathcalM$, $ain A$ can be written as $a=t^mathcalM(c_a)$ where $c_a in I$. take $J=cup_ain A c_a$. then we can show |types over $A$| $leq$|types over J| in $mathcalM$. So it is enough to show latter one$leq |A|+omega$. Now define equivalence relation as follows:
$forall_n<omegaforallbarc,bardin[I]^n barc simbardLeftrightarrow forall_1leq kleq nforall ein J, (c_k<eleftrightarrow d_k<e) wedge (c_k=eleftrightarrow d_k=e)$
where $barc=(c_1,...,c_n),bard=(d_1,...,d_n)$ increasing sequence in $[I]^n$. I'm proving for any term $t(barx)inmathcalL^*$ having n-variables, $barcsimbard$ implies $tp_mathcalM(t^M(barc)/J)=tp_mathcalM(t^M(bard)/J)$. In my note, it is written that "$tp_mathcalM(barc/J)=tp_mathcalM(bard/J)$ implies equality above". but I could prove the former one but I don't know how to get the latter one from first one..
model-theory
$endgroup$
Given complete $T$ in countable language, prove for any $kappa >omega$, $exists mathcalMmodels T$ such that $forall AsubseteqmathcalM, mathcalM$ realizes at most $|A|+omega$ types n $S^mathcalM_n(A)$.
Proof goes like this(in Lecture note I'm using). Take $mathcalM$ indiscernible hull of indiscernible $I$ cardinality of $kappa$. Here $mathcalM$ is model of skolemization of $T$ in corresponding language $mathcalL^*$. Given $AsubseteqmathcalM$, $ain A$ can be written as $a=t^mathcalM(c_a)$ where $c_a in I$. take $J=cup_ain A c_a$. then we can show |types over $A$| $leq$|types over J| in $mathcalM$. So it is enough to show latter one$leq |A|+omega$. Now define equivalence relation as follows:
$forall_n<omegaforallbarc,bardin[I]^n barc simbardLeftrightarrow forall_1leq kleq nforall ein J, (c_k<eleftrightarrow d_k<e) wedge (c_k=eleftrightarrow d_k=e)$
where $barc=(c_1,...,c_n),bard=(d_1,...,d_n)$ increasing sequence in $[I]^n$. I'm proving for any term $t(barx)inmathcalL^*$ having n-variables, $barcsimbard$ implies $tp_mathcalM(t^M(barc)/J)=tp_mathcalM(t^M(bard)/J)$. In my note, it is written that "$tp_mathcalM(barc/J)=tp_mathcalM(bard/J)$ implies equality above". but I could prove the former one but I don't know how to get the latter one from first one..
model-theory
model-theory
edited Mar 21 at 8:00
fbg
asked Mar 21 at 7:50
fbgfbg
473311
473311
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is an almost immediate consequence of indiscernibility. The intuitive meaning of $overlinecsimoverlined$ is that $overlinec$ and $overlined$ "come in the same order" in $I$ relative to the set $J$. In particular, if $overlinee$ is a finite tuple from $J$, then $overlinecoverlinee$ and $overlinedoverlinee$ are both finite tuples from $I$ which "come in the same order", so they satisfy the same formulas by indiscernibility.
More precisely:
Suppose $varphi(x,overlinee)in texttp_mathcalM(t^M(overlinec)/J)$ and $overlinecsim overlined$. Consider the formula $psi(overlinez,overlinew)$ given by $varphi(t(overlinez),overlinew)$.
We have $mathcalMmodels varphi(t^M(overlinec),overlinee)$, so $mathcalMmodels psi(overlinec,overlinee)$. And by indiscernibility, since $overlinecsimoverlined$, we also have $mathcalMmodels psi(overlined,overlinee)$. So $mathcalMmodels varphi(t(overlined),overlinee)$, and $varphi(x,overlinee)in texttp_mathcalM(t^M(overlined)/J)$. Thus $texttp_mathcalM(t^M(overlinec)/J) = texttp_mathcalM(t^M(overlined)/J)$.
$endgroup$
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
add a comment |
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
);
);
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%2f3156491%2findiscernible-sequences-in-countable-complete-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$
This is an almost immediate consequence of indiscernibility. The intuitive meaning of $overlinecsimoverlined$ is that $overlinec$ and $overlined$ "come in the same order" in $I$ relative to the set $J$. In particular, if $overlinee$ is a finite tuple from $J$, then $overlinecoverlinee$ and $overlinedoverlinee$ are both finite tuples from $I$ which "come in the same order", so they satisfy the same formulas by indiscernibility.
More precisely:
Suppose $varphi(x,overlinee)in texttp_mathcalM(t^M(overlinec)/J)$ and $overlinecsim overlined$. Consider the formula $psi(overlinez,overlinew)$ given by $varphi(t(overlinez),overlinew)$.
We have $mathcalMmodels varphi(t^M(overlinec),overlinee)$, so $mathcalMmodels psi(overlinec,overlinee)$. And by indiscernibility, since $overlinecsimoverlined$, we also have $mathcalMmodels psi(overlined,overlinee)$. So $mathcalMmodels varphi(t(overlined),overlinee)$, and $varphi(x,overlinee)in texttp_mathcalM(t^M(overlined)/J)$. Thus $texttp_mathcalM(t^M(overlinec)/J) = texttp_mathcalM(t^M(overlined)/J)$.
$endgroup$
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
add a comment |
$begingroup$
This is an almost immediate consequence of indiscernibility. The intuitive meaning of $overlinecsimoverlined$ is that $overlinec$ and $overlined$ "come in the same order" in $I$ relative to the set $J$. In particular, if $overlinee$ is a finite tuple from $J$, then $overlinecoverlinee$ and $overlinedoverlinee$ are both finite tuples from $I$ which "come in the same order", so they satisfy the same formulas by indiscernibility.
More precisely:
Suppose $varphi(x,overlinee)in texttp_mathcalM(t^M(overlinec)/J)$ and $overlinecsim overlined$. Consider the formula $psi(overlinez,overlinew)$ given by $varphi(t(overlinez),overlinew)$.
We have $mathcalMmodels varphi(t^M(overlinec),overlinee)$, so $mathcalMmodels psi(overlinec,overlinee)$. And by indiscernibility, since $overlinecsimoverlined$, we also have $mathcalMmodels psi(overlined,overlinee)$. So $mathcalMmodels varphi(t(overlined),overlinee)$, and $varphi(x,overlinee)in texttp_mathcalM(t^M(overlined)/J)$. Thus $texttp_mathcalM(t^M(overlinec)/J) = texttp_mathcalM(t^M(overlined)/J)$.
$endgroup$
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
add a comment |
$begingroup$
This is an almost immediate consequence of indiscernibility. The intuitive meaning of $overlinecsimoverlined$ is that $overlinec$ and $overlined$ "come in the same order" in $I$ relative to the set $J$. In particular, if $overlinee$ is a finite tuple from $J$, then $overlinecoverlinee$ and $overlinedoverlinee$ are both finite tuples from $I$ which "come in the same order", so they satisfy the same formulas by indiscernibility.
More precisely:
Suppose $varphi(x,overlinee)in texttp_mathcalM(t^M(overlinec)/J)$ and $overlinecsim overlined$. Consider the formula $psi(overlinez,overlinew)$ given by $varphi(t(overlinez),overlinew)$.
We have $mathcalMmodels varphi(t^M(overlinec),overlinee)$, so $mathcalMmodels psi(overlinec,overlinee)$. And by indiscernibility, since $overlinecsimoverlined$, we also have $mathcalMmodels psi(overlined,overlinee)$. So $mathcalMmodels varphi(t(overlined),overlinee)$, and $varphi(x,overlinee)in texttp_mathcalM(t^M(overlined)/J)$. Thus $texttp_mathcalM(t^M(overlinec)/J) = texttp_mathcalM(t^M(overlined)/J)$.
$endgroup$
This is an almost immediate consequence of indiscernibility. The intuitive meaning of $overlinecsimoverlined$ is that $overlinec$ and $overlined$ "come in the same order" in $I$ relative to the set $J$. In particular, if $overlinee$ is a finite tuple from $J$, then $overlinecoverlinee$ and $overlinedoverlinee$ are both finite tuples from $I$ which "come in the same order", so they satisfy the same formulas by indiscernibility.
More precisely:
Suppose $varphi(x,overlinee)in texttp_mathcalM(t^M(overlinec)/J)$ and $overlinecsim overlined$. Consider the formula $psi(overlinez,overlinew)$ given by $varphi(t(overlinez),overlinew)$.
We have $mathcalMmodels varphi(t^M(overlinec),overlinee)$, so $mathcalMmodels psi(overlinec,overlinee)$. And by indiscernibility, since $overlinecsimoverlined$, we also have $mathcalMmodels psi(overlined,overlinee)$. So $mathcalMmodels varphi(t(overlined),overlinee)$, and $varphi(x,overlinee)in texttp_mathcalM(t^M(overlined)/J)$. Thus $texttp_mathcalM(t^M(overlinec)/J) = texttp_mathcalM(t^M(overlined)/J)$.
edited Mar 22 at 13:57
answered Mar 22 at 6:51
Alex KruckmanAlex Kruckman
28.4k32758
28.4k32758
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
add a comment |
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
I don't know why $mathcalMmodels varphi(t^mathcalM(barc),e_1,...,e_k)$ and $barcsimbard$ implies $mathcalMmodels varphi(t^mathcalM(bard),e_1,...,e_k)$. it seems that $barcsimbard$ implies $bart(barc)simbart(bard)$ but I don't know how to prove this. I want to know how $sim$ affects the argument
$endgroup$
– fbg
Mar 22 at 7:34
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
Do you know what "indiscernible" means? @fbg
$endgroup$
– Alex Kruckman
Mar 22 at 13:06
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
@fbg I've added a bit more detail to my answer. Let me know if that helps.
$endgroup$
– Alex Kruckman
Mar 22 at 13:58
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
Also, your assertion $overlinecsim overlined$ implies $t(overlinec)sim t(overlined)$ doesn't make any sense, since $sim$ is only defined on tuples from $I$, and $t(overlinec)$ might not be an element of $I$.
$endgroup$
– Alex Kruckman
Mar 23 at 5:37
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
$begingroup$
I couldn't thought about letting $varphi(t^mathcalM(barz),barw)$ as $psi(barz,barw)$. Now I see how it works. Thank you
$endgroup$
– fbg
Mar 25 at 4:17
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%2f3156491%2findiscernible-sequences-in-countable-complete-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