OurBigBook About$ Donate
 Sign in Sign up

Definable type

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Model theory Stable theory Fundamental theorem of stability
2026-09-28  0 By others on same topic  0 Discussions Create my own version
A type p(x) over a model M is definable when, for every formula φ(x;y), there is an M-formula dp​φ(y) such that
φ(x;b)∈p⟺M⊨dp​φ(b)
(1)
for every tuple b from M.
  • Table of contents
    • Stable trace of a definable set Definable type

Stable trace of a definable set

 0  0
Definable type
If T is stable, M≼N⊨T, and X⊆Nn is definable with parameters from N, then X∩Mn is definable with parameters from M. Apply definability of the type over M of the parameter defining X.

 Ancestors (7)

  1. Fundamental theorem of stability
  2. Stable theory
  3. Model theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 144 / 2 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 144 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook