Loading AI tools
Mathematical logic theory with exactly one countably infinite model up to isomorphism From Wikipedia, the free encyclopedia
In mathematical logic, an omega-categorical theory is a theory that has exactly one countably infinite model up to isomorphism. Omega-categoricity is the special case κ = = ω of κ-categoricity, and omega-categorical theories are also referred to as ω-categorical. The notion is most important for countable first-order theories.
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 of any countably infinite structure which is homogeneous over a finite relational language is omega-categorical.[5] More generally, the theory of the Fraïssé limit of any uniformly locally finite Fraïssé class is omega-categorical.[6] Hence, the following theories are omega-categorical:
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.