Main Page: Difference between revisions

Revision as of 12:54, 13 August 2014

Template:Unreferenced stub A Cherenkov (Čerenkov) detector is a particle detector using the mass-dependent threshold energy of Cherenkov radiation. This allows a discrimination between a lighter particle (which does radiate) and a heavier particle (which does not radiate).

It is a more advanced form of scintillation counter. A particle passing through a material at a velocity greater than that at which light can travel through the material emits light. This is similar to the production of a sonic boom when an airplane is traveling through the air faster than sound waves can move through the air. This light is emitted in a cone about the direction in which the particle is moving. The angle of the cone, $θ_{c}$ , is a direct measure of the particle's velocity through the formula

\cos θ_{c} = \frac{c}{n v}

,

where $c$ is the speed of light, and $n$ is the refractive index of the medium. Alternatively, if the momentum of the particle is known (from magnetic bending) the Cherenkov's information on the particle's velocity enables the mass to be deduced so that the particle can be identified.

@@ Line 1: / Line 1: @@
-In the branch of [[mathematical logic]] called [[model theory]], an '''elementary class''' (or '''axiomatizable class''') is a [[class (set theory)|class]] consisting of all [[structure (mathematical logic)|structures]] satisfying a fixed [[first-order logic|first-order]] [[theory (mathematical logic)|theory]].
+{{Unreferenced stub|auto=yes|date=December 2009}}
+A '''Cherenkov (Čerenkov) detector''' is a [[particle detector]] using the mass-dependent threshold energy of [[Cherenkov radiation]]. This allows a discrimination between a lighter particle (which does radiate) and a heavier particle (which does not radiate).
-== Definition ==
+It is a more advanced form of [[scintillation counter]]. A particle passing through a material at a velocity greater than that at which light can travel through the material emits light.  This is similar to the production of a [[sonic boom]] when an airplane is traveling through the air faster than sound waves can move through the air. This light is emitted in a cone about the direction in which the particle is moving. The angle of the cone, <math>\scriptstyle \theta_c </math>, is a direct measure of the particle's velocity through the formula
-A [[class (set theory)|class]] ''K'' of [[structure (mathematical logic)|structures]] of a [[signature (logic)|signature]] σ is called an '''elementary class''' if there is a [[first-order logic|first-order]] [[theory (mathematical logic)|theory]] ''T'' of signature σ, such that ''K'' consists of all models of ''T'', i.e., of all σ-structures that satisfy ''T''. If ''T'' can be chosen as a theory consisting of a single first-order sentence, then ''K'' is called a '''basic elementary class'''.
+:<math>\cos \theta_c = \frac{c}{nv}</math>,
-More generally, ''K'' is a [[pseudoelementary class|pseudo-elementary class]] if there is a first-order theory ''T'' of a signature that extends σ, such that ''K'' consists of all σ-structures that are [[reduct]]s to σ of models of ''T''. In other words, a class ''K'' of σ-structures is pseudo-elementary [[iff]] there is an elementary class ''K<nowiki>'</nowiki>'' such that ''K'' consists of precisely the reducts to σ of the structures in ''K<nowiki>'</nowiki>''.
+where <math>\scriptstyle c</math> is the [[speed of light]], and <math>\scriptstyle n </math> is the [[refractive index]] of the medium.  Alternatively, if the momentum of the particle is known (from magnetic bending) the Cherenkov's information on the particle's velocity enables the mass to be deduced so that the particle can be identified.
-For obvious reasons, elementary classes are also called '''axiomatizable in first-order logic''', and basic elementary classes are called '''finitely axiomatizable in first-order logic'''. These definitions extend to other logics in the obvious way, but since the first-order case is by far the most important, '''axiomatizable''' implicitly refers to this case when no other logic is specified.
+==See also==
+*[[Ring imaging Cherenkov detector]]
+*[[Super-Kamiokande]]
+*[[Cherenkov radiation]]
-== Conflicting and alternative terminology ==
+{{DEFAULTSORT:Cherenkov Detector}}
+[[Category:Particle detectors]]
+[[Category:Russian inventions]]
+[[Category:Soviet inventions]]
-While the above is nowadays standard terminology in [[model theory|"infinite" model theory]], the slightly different earlier definitions are still in use in [[finite model theory]], where an elementary class may be called a '''Δ-elementary class''', and the terms '''elementary class''' and '''first-order axiomatizable class''' are reserved for basic elementary classes (Ebbinghaus et al. 1994, Ebbinghaus and Flum 2005). Hodges calls elementary classes [[axiomatizable class]]es, and he refers to basic elementary classes as '''definable classes'''. He also uses the respective synonyms '''EC class''' and '''EC<math>_\Delta</math> class''' (Hodges, 1993).
+{{Particle-stub}}
-There are good reasons for this diverging terminology. The [[signature (logic)|signature]]s that are considered in general model theory are often infinite, while a single [[first-order logic|first-order]] [[sentence (mathematical logic)|sentence]] contains only finitely many symbols. Therefore basic elementary classes are atypical in infinite model theory. Finite model theory, on the other hand, deals almost exclusively with finite signatures. It is easy to see that for every finite signature σ and for every class ''K'' of σ-structures closed under isomorphism there is an elementary class <math>K'</math> of σ-structures such that ''K'' and <math>K'</math> contain precisely the same finite structures. Hence elementary classes are not very interesting for finite model theorists.
+[[ar:عداد شيرينكوف]]
+[[ca:Detector Txerenkov]]
-== Easy relations between the notions ==
+[[cs:Čerenkovův detektor]]
+[[es:Detector Cherenkov]]
-Clearly every basic elementary class is an elementary class, and every elementary class is a pseudo-elementary class. Moreover, as an easy consequence of the [[compactness theorem]], a class of σ-structures is basic elementary if and only if it is elementary and its complement is also elementary.
+[[fr:Détecteur Tcherenkov]]
+[[ru:Черенковский детектор]]
-== Examples ==
-=== A basic elementary class ===
-Let σ be a signature consisting only of a [[unary function]] symbol ''f''.  The class ''K'' of σ-structures in which ''f'' is [[injection (mathematics)|one-to-one]] is a basic elementary class. This is witnessed by the theory ''T'', which consists only of the single sentence
-:<math>\forall x\forall y( (f(x)=f(y)) \to (x=y) )</math>.
-=== An elementary, basic pseudoelementary class that is not basic elementary ===
-Let σ be an arbitrary signature. The class ''K'' of all infinite σ-structures is elementary. To see this, consider the sentences
-:<math>\rho_2={}</math> "<math>\exist x_1\exist x_2(x_1 \not =x_2)</math>",
-:<math>\rho_3={}</math> "<math>\exist x_1\exist x_2\exist x_3((x_1 \not =x_2) \and (x_1 \not =x_3) \and (x_2 \not =x_3))</math>",
-and so on. (So the sentence <math>\rho_n</math> says that there are at least ''n'' elements.) The infinite σ-structures are precisely the models of the theory
-:<math>T_\infty=\{\rho_2, \rho_3, \rho_4, \dots\}</math>.
-But ''K'' is not a basic elementary class. Otherwise the infinite σ-structures would be precisely those that satisfy a certain first-order sentence τ. But then the set
-<math>\{\neg\tau, \rho_2, \rho_3, \rho_4, \dots\}</math> would be inconsistent. By the [[compactness theorem]], for some natural number ''n'' the set <math>\{\neg\tau, \rho_2, \rho_3, \rho_4, \dots, \rho_n\}</math> would be inconsistent. But this is absurd, because this theory is satisfied by any σ-structure with <math>n+1</math> or more elements.
-However, there is a basic elementary class ''K<nowiki>'</nowiki>'' in the signature σ' = σ <math>\cup</math> {''f''}, where ''f'' is a unary function symbol, such that ''K'' consists exactly of the reducts to σ of σ'-structures in ''K<nowiki>'</nowiki>''. ''K<nowiki>'</nowiki>'' is axiomatised by the single sentence <math>(\forall x\forall y(f(x) = f(y) \rightarrow x=y) \land \exists y\neg\exists x(y = f(x))),</math>, which expresses that ''f'' is injective but not surjective. Therefore ''K'' is elementary and what could be called basic pseudo-elementary, but not basic elementary.
-=== Pseudo-elementary class that is non-elementary ===
-Finally, consider the signature σ consisting of a single unary relation symbol ''P''. Every σ-structure is [[partition of a set|partitioned]] into two subsets: Those elements for which ''P'' holds, and the rest. Let ''K'' be the class of all σ-structures for which these two subsets have the same [[cardinality]], i.e., there is a bijection between them. This class is not elementary, because a σ-structure in which both the set of realisations of ''P'' and its complement are countably infinite satisfies precisely the same first-order sentences as a σ-structure in which one of the sets is countably infinite and the other is uncountable.
-Now consider the signature <math>\sigma'</math>, which consists of ''P'' along with a unary function symbol ''f''. Let <math>K'</math> be the class of all <math>\sigma'</math>-structures such that ''f'' is a bijection and ''P'' holds for ''x'' [[iff]] ''P'' does not hold for ''f(x)''. <math>K'</math> is clearly an elementary class, and therefore ''K'' is an example of a pseudo-elementary class that is not elementary.
-=== Non-pseudo-elementary class===
-Let σ be an arbitrary signature. The class ''K'' of all finite σ-structures is not elementary, because (as shown above) its complement is elementary but not basic elementary. Since this is also true for every signature extending σ, ''K'' is not even a pseudo-elementary class.
-This example demonstrates the limits of expressive power inherent in [[first-order logic]] as opposed to the far more expressive [[second-order logic]]. Second-order logic, however, fails to retain many desirable properties of first-order logic, such as the compactness theorem.
-== References ==
-* {{Citation | last1=Chang | first1=Chen Chung | last2=Keisler | first2=H. Jerome | author2-link=Howard Jerome Keisler | title=Model Theory | origyear=1973 | publisher=[[Elsevier]] | edition=3rd | series=Studies in Logic and the Foundations of Mathematics | isbn=978-0-444-88054-3 | year=1990}}
-* {{Citation | last1=Ebbinghaus | first1=Heinz-Dieter | last2=Flum | first2=Jörg | title=Finite model theory | origyear=1995 | publisher=[[Springer-Verlag]] | location=Berlin, New York | isbn=978-3-540-28787-2 | year=2005 | pages=360}}
-* {{Citation | last1=Ebbinghaus | first1=Heinz-Dieter | last2=Flum | first2=Jörg | last3=Thomas | first3=Wolfgang | title=Mathematical Logic | publisher=[[Springer-Verlag]] | location=Berlin, New York | edition=2nd | isbn=978-0-387-94258-2 | year=1994}}
-* {{Citation | last1=Hodges | first1=Wilfrid | author1-link=Wilfrid Hodges | title=A shorter model theory | publisher=[[Cambridge University Press]] | isbn=978-0-521-58713-6 | year=1997}}
-* {{Citation | last1=Poizat | first1=Bruno | title=A Course in Model Theory: An Introduction to Contemporary Mathematical Logic | publisher=[[Springer-Verlag]] | location=Berlin, New York | isbn=978-0-387-98655-5 | year=2000}}
-{{DEFAULTSORT:Elementary Class}}
-[[Category:Model theory]]
-[[de:Elementare Klasse]]
-[[nl:Elementaire klasse]]

Main Page: Difference between revisions

Revision as of 12:54, 13 August 2014

See also

Navigation menu

Search