Longest element of a Coxeter group: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>R.e.b.
Merge examples section
 
en>Tomruen
 
Line 1: Line 1:
{{about|the device|the [[Hawkwind]] song|Silver Machine}}
[http://Autos.jdpower.com/content/buying-tip/xa345A7/pros-and-cons-of-buying-an-extended-warranty-for-a-car.htm Yoshiko] is her name but she doesn't like when individuals use her full title. Her family members lives in Delaware but she needs to transfer because auto warranty of her family members. Managing individuals is how she makes money and she will not alter it anytime quickly. The [http://www.allstate.com/tools-and-resources/car-insurance/whats-in-a-new-car-warranty.aspx preferred pastime] for my children and me is extended auto [https://deathcontrol.de/index/users/view/id/2759 car warranty] taking part in crochet and now I'm attempting to make cash with it.<br><br>[http://Www.consumerreports.org/cro/magazine/2014/04/extended-warranties-for-cars-are-an-expensive-game/ Feel free] to  [http://www.praxis-simone-ernstberger.de/index.php?mod=users&action=view&id=8591 extended car warranty] visit my blog :: [http://Help.Ksu.Edu.sa/node/63594 Help.Ksu.Edu.sa]
:''Not to be confused with [[Silver Machines]].''
 
In [[set theory]], '''Silver machines''' are devices used for bypassing the use of [[fine structure theory (set theory)|fine structure]] in proofs of [[statements true in L|statements holding in L]]. They were invented by set theorist [[Jack Silver]] as a means of proving [[global square]] holds in the [[constructible universe]].
 
==Preliminaries==
An [[Ordinal number|ordinal]] <math>\alpha</math> is ''*definable'' from a class of ordinals X if and only if there is a formula <math>\phi(\mu_0,\mu_1, \ldots ,\mu_n)</math> and <math>\exists \beta_1, \ldots , \beta_n,\gamma \in X </math> such that <math>\alpha</math> is the unique ordinal for which <math>\models_{L_\gamma} \phi(\alpha^\circ,\beta_1^\circ, \ldots , \beta^\circ_n)</math> where for all <math>\alpha</math> we define <math>\alpha^\circ</math> to be the name for <math>\alpha</math> within <math>L_\gamma</math>.
 
A structure <math>\langle X, < , (h_i)_{i<\omega} \rangle</math> is ''eligible'' if and only if:
 
# <math>X \subseteq On</math>.
# < is the ordering on On restricted to X.
# <math>\forall i, h_i</math> is a partial function from <math>X^{k(i)}</math> to X, for some integer k(i).
 
If <math>N=\langle X, < , (h_i)_{i<\omega} \rangle</math> is an eligible structure then <math>N_\lambda</math> is defined to be as before but with all occurrences of X replaced with <math>X \cap \lambda</math>.
 
Let <math>N^1, N^2</math> be two eligible structures which have the same function k.  Then we say <math>N^1 \triangleleft N^2</math> if <math>\forall i \in \omega</math> and <math>\forall x_1, \ldots , x_{k(i)} \in X^1</math> we have:
 
<math>h_i^1(x_1, \ldots , x_{k(i)}) \cong h_i^2(x_1, \ldots , x_{k(i)})</math>
 
==Silver machine==
A Silver machine is an eligible structure of the form <math>M=\langle On, < , (h_i)_{i<\omega} \rangle</math> which satisfies the following conditions:
 
''Condensation principle.''  If <math>N \triangleleft M_\lambda</math> then there is an <math>\alpha</math> such that <math>N \cong M_\alpha</math>.
 
''Finiteness principle.''  For each <math>\lambda</math> there is a finite set <math>H \subseteq \lambda</math> such that for any set <math>A \subseteq \lambda +1</math> we have
 
: <math>M_{\lambda+1}[A] \subseteq M_\lambda[(A \cap \lambda) \cup H] \cup \{\lambda\}</math>
 
''Skolem property.'' If <math>\alpha</math> is *definable from the set <math>X \subseteq On</math>, then <math>\alpha \in M[X]</math>; moreover there is an ordinal <math>\lambda < [sup(X) \cup \alpha]^+</math>, uniformly <math>\Sigma_1</math> definable from <math>X \cup \{\alpha\}</math>, such that <math>\alpha \in M_\lambda[X]</math>.
 
==References==
*{{cite book | title=Constructibility | chapter=Chapter IX | author=[[Keith Devlin|Keith J Devlin]] | id=<small>ISBN 0-387-13258-9</small> | year = 1984}} - Please note that errors have been found in some results in this book concerning Kripke Platek set theory.
 
[[Category:Constructible universe]]

Latest revision as of 01:36, 11 April 2014

Yoshiko is her name but she doesn't like when individuals use her full title. Her family members lives in Delaware but she needs to transfer because auto warranty of her family members. Managing individuals is how she makes money and she will not alter it anytime quickly. The preferred pastime for my children and me is extended auto car warranty taking part in crochet and now I'm attempting to make cash with it.

Feel free to extended car warranty visit my blog :: Help.Ksu.Edu.sa