C-minimal theory: Difference between revisions

Revision as of 22:41, 20 January 2008

Revision as of 22:51, 20 January 2008

Line 10:

# <math>\forall xyzw [ C(x;yz)\rightarrow (C(w;yz)\vee C(x;wz)) ]</math>,

# <math>\forall xy [ x\neq y \rightarrow \exists z\neq y C(x;yz) ]</math>.

A '''C-minimal structure''' is a [[structure (mathematical logic)|structure]] ''M'', in a [[signature (mathematical 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 ''C''(''x'';''bc'')'', where ''b'' and ''c'' are elements of ''M''. A theory is called C-minimal if all of its models are C-minimal.

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==