Definition:Definable
usual
Until this has been finished, please leave {{refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
Definable Element
Let $\mathcal M$ be an $\mathcal L$-structure with universe $M$.
Let $A$ be a subset of $M$.
Let $\bar b$ be an ordered $n$-tuple of elements from $M$.
Let $\mathcal L_A$ be the language formed by adding constant symbols to $\mathcal L$ for each element of $A$.
$\bar b$ is definable over $A$ if there is an $\mathcal L_A$-formula $\phi \left({\bar x}\right)$ with $n$ free variables such that the set $\left\{{\bar m \in M^n : \mathcal M \models \phi \left({\bar m}\right)}\right\}$ contains $\bar b$ but nothing else.
If you are familiar with this area of mathematics, you may be able to help improve $\mathsf{Pr} \infty \mathsf{fWiki}$ by determining the precise term which is to be used.
To discuss it in more detail, feel free to use the talk page.
When this has been done, {{Disambiguate}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Also defined as
The following definition is sometimes used. It is not equivalent in general. However, these definitions are equivalent when working in a saturated model. This is proved in Definable iff Singleton Orbit.
$\bar b$ is definable over $A$ if every $A$-automorphism is an $A, b$-automorphism.
Definable Set
We say that the subset $A$ is a definable set in $\mathcal M$ if there is a formula $\phi \left({x}\right)$ such that $a \in A$ iff $\mathcal M \models \phi \left({a}\right)$.
Sources
- 1971: Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory: $\S 4.15$
