In the one-sorted vector-space language naming each scalar multiplication, a first-order formula reduces by quantifier elimination to finitely many linear equations. An independent pair satisfies only the identically zero equations among them. A dependent pair with nonzero satisfies the same listed equations if the scalar avoids their finitely many forbidden ratios, which is possible over an infinite field. Thus no formula defines pair independence. The complete independent-pair type is still consistent in an infinite-dimensional model; it is nonisolated.
Articles by others on the same topic
There are currently no matching articles.