Mathematical logic and foundations Definition
NIP theory
Builds on Complete theoryWell-formed formulaModel
Definition
Let be a complete theory in a first-order language . Let be an -formula whose free variables are split into two tuples and . The formula has the independence property in if the following holds for every . There are a model of , tuples in , and tuples in for each . For all and , holds if and only if . The theory is NIP if no -formula has the independence property in .
Remarks
Example: the theory of dense linear orders without endpoints is NIP. By quantifier elimination, a formula defines, for each parameter , a union of at most points and intervals. The endpoints are entries of , and depends only on . Such a family cannot cut out all subsets of a set of points once is large. It is a standard fact that it suffices to check formulas with a single variable.
Non-example: the theory of the Rado graph is not NIP. For the formula , take distinct vertices ; by the extension property, for each there is a vertex adjacent to exactly when .
Equivalently, is NIP if for every formula and every model of , the family has finite VC dimension. Every stable theory and every o-minimal theory is NIP.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Complete theory concept
- Model concept
- Well-formed formula concept
- NIP theory definition
Further reading
About this page
| Tag | JR0N0BDR3B |
|---|---|
| URI | m2://JR0N0BDR3B |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C45 |
| Defines | NIP theory |
| Uses | Complete theory, Well-formed formula, Model |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.