Omega-categorical theory

In mathematical logic, an omega-categorical theory is a theory that has only one countable model up to isomorphism. Omega-categoricity is the special case κ = $\aleph_0$ = ω of κ-categoricity, and omega-categorical theories are also referred to as ω-categorical. The notion is most important for countable first-order theories.

Equivalent conditions for omega-categoricity

Many conditions on a theory are equivalent to the property of omega-categoricity. In 1959 Erwin Engeler, Czesław Ryll-Nardzewski and Lars Svenonius, proved several independently^[1]. Despite this, the literature still widely refers to the Ryll-Nardzewski theorem as a name for these conditions. The conditions included with the theorem vary between authors^[2][3].

Given a countable complete first-order theory T with infinite models, the following are equivalent:

• The theory T is omega-categorical.
• Every countable model of T has an oligomorphic automorphism group.
• Some countable model of T has an oligomorphic automorphism group.
• The theory T has a model which, for every natural number n, realizes only finitely many n-types, that is, the Stone space S_n(T) is finite.
• For every natural number n, T has only finitely many n-types.
• For every natural number n, every n-type is isolated.
• For every natural number n, up to equivalence modulo T there are only finitely many formulas with n free variables, in other words, every nth Lindenbaum-Tarski algebra of T is finite.
• Every model of T is atomic.
• Every countable model of T is atomic.
• The theory T has a countable atomic and saturated model.
• The theory T has a saturated prime model.

Notes

1. ^ Rami Grossberg, José Iovino and Olivier Lessmann, A primer of simple theories
2. ^ Hodges, Model Theory, p. 341.
3. ^ Rothmaler, p. 200.

References

• Chang, Chen Chung; Keisler, H. Jerome (1989) [1973], Model Theory, Elsevier, ISBN 978-0-7204-0692-4 
• Hodges, Wilfrid (1993), Model theory, Cambridge: Cambridge University Press, ISBN 978-0-521-30442-9 
• Hodges, Wilfrid (1997), A shorter model theory, Cambridge: Cambridge University Press, ISBN 978-0-521-58713-6 
• Poizat, Bruno (2000), A Course in Model Theory: An Introduction to Contemporary Mathematical Logic, Berlin, New York: Springer-Verlag, ISBN 978-0-387-98655-5 
• Rothmaler, Philipp (2000), Introduction to Model Theory, New York: Taylor & Francis Group, ISBN 978-90-5699-313-9 

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Mathematical logic stubs Model theory Wikimedia Foundation. 2010. Игры ⚽ Нужен реферат? Count to Ten (album) Countably generated Look at other dictionaries: Bass–Serre theory — is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated… …   Wikipedia Spectrum of a theory — In model theory, a branch of mathematical logic, the spectrum of a theory is given by the number of isomorphism classes of models in various cardinalities. More precisely, for any complete theory T in a language we write I(T, α) for the number of …   Wikipedia Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… …   Wikipedia Random graph — In mathematics, a random graph is a graph that is generated by some random process. The theory of random graphs lies at the intersection between graph theory and probability theory, and studies the properties of typical random graphs.Random graph …   Wikipedia Type (théorie des modèles) — Pour les articles homonymes, voir Type. En théorie des modèles, un type est un ensemble de formules à une même variable libre, consistant avec une théorie donnée, c est à dire tel qu il existe un modèle de la théorie en question dont un élément… …   Wikipédia en Français Probability distribution — This article is about probability distribution. For generalized functions in mathematical analysis, see Distribution (mathematics). For other uses, see Distribution (disambiguation). In probability theory, a probability mass, probability density …   Wikipedia Total variation — As the green ball travels on the graph of the given function, the length of the path travelled by that ball s projection on the y axis, shown as a red ball, is the total variation of the function. In mathematics, the total variation identifies… …   Wikipedia logic, history of — Introduction       the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic       There was a medieval tradition according to which the Greek philosopher …   Universalium Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia Stone duality — In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”