Content deleted Content added
Hans Adler (talk | contribs) Standard example |
m lk |
||
(21 intermediate revisions by 13 users not shown) | |||
Line 1:
In [[model theory]], a branch of [[mathematical logic]], a '''C-minimal theory''' is a theory
This notion was defined in analogy to the [[o-minimal theory|o-minimal theories]], which are "minimal" (in the same sense) with respect to a linear order.
== Definition ==
A ''C''-relation is a ternary relation {{nowrap|''C''(''x''; ''
# <math>\forall xyz\, [ C(x;
# <math>\forall xyz\, [ C(x;
# <math>\forall xyzw\, [ C(x;
# <math>\forall xy\, [ x\neq y \rightarrow \exists z\neq y\, C(x;
A '''C-minimal structure''' is a [[structure (mathematical logic)|structure]] ''M'', in a [[signature (
A theory is called '''C-minimal''' if all of its models are C-minimal. A structure is called '''strongly C-minimal''' if its theory is C-minimal. One can construct C-minimal structures which are not strongly C-minimal.
==Example==▼
▲== Example ==
For a [[prime number]] ''p'' and a [[p-adic number|''p''-adic number]] ''a'' let |''a''|<sub>''p''</sub> denote its ''p''-adic norm. Then the relation defined by <math>C(a;bc) \iff |b-c|_p < |a-c|_p</math> is a ''C''-relation, and the theory of '''Q'''<sub>''p''</sub> is C-minimal with respect to this relation.▼
▲For a [[prime number]] ''p'' and a [[p-adic number|''p''-adic number]] ''a'', let {{abs|''a''
==References==▼
▲== References ==
* {{Citation | last1=Macpherson | first1=Dugald | author1-link=Dugald Macpherson | last2=Steinhorn | first2=Charles | title=On variants of o-minimality | doi=10.1016/0168-0072(95)00037-2 | year=1996 | journal=Annals of Pure and Applied Logic | volume=79 | pages=165–209}}▼
* {{Citation | last1=Haskell | first1=Deirdre | last2=Macpherson | first2=Dugald | author2-link=Dugald Macpherson | title=Cell decompositions of C-minimal structures | year=1994 | journal=Annals of Pure and Applied Logic | volume=66 | pages=113–162}}▼
▲* {{
[[Category:Model theory]]▼
▲* {{
{{Mathematical logic}}
▲[[Category:Model theory]]
|