Content deleted Content added
Added {{Mathematical logic}} |
m lk |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 1:
In [[model theory]], a branch of [[mathematical logic]], a '''C-minimal theory''' is a theory that is "minimal" with respect to a [[Triadic relation|ternary relation]] ''C'' with certain properties. [[Algebraically closed
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''; ''y'', ''z'')}} that satisfies the following axioms.
# <math>\forall xyz\, [ C(x;y,z)\rightarrow C(x;z,y) ],</math>
# <math>\forall xyz\, [ C(x;y,z)\rightarrow\neg C(y;x,z) ],</math>
# <math>\forall xyzw\, [ C(x;y,z)\rightarrow (C(w;y,z)\vee C(x;w,z)) ],</math>
# <math>\forall xy\, [ x\neq y \rightarrow \exists z\neq y\, C(x;y,z) ].</math>
A '''C-minimal structure''' is a [[structure (mathematical logic)|structure]] ''M'', in a [[signature (logic)|signature]] containing the symbol ''C'', such that ''C'' satisfies the above axioms and every set of elements of ''M'' that is definable with parameters in ''M'' is a Boolean combination of instances of ''C'', i.e. of formulas of the form {{nowrap|''C''(''x''; ''b'', ''c'')}}, where ''b'' and ''c'' are elements of ''M''.
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 ==
For a [[prime number]] ''p'' and a [[p-adic number|''p''-adic number]] ''a'', let {{abs|''a''
== References ==
* {{
* {{
{{Mathematical logic}}
|