Indiscernibles

From Wikipedia, the free encyclopedia

In mathematical logic, indiscernibles are objects which cannot be distinguished by any property or relation defined by a formula. Usually only first-order formulas are considered. For example, if {A, B, C} is indiscernable, then for each 2-ary formula K, we must have K(A, B) if and only if K(B, A) if and only if K(C, A) if and only if K(A, C) if and only if K(B, C) if and only if K(C, B).

It is also common to consider "order-indiscernables", which possess a total ordering, and satisfy relations dependent only on the relative order of the arguments. If the set above were only order-indiscernable (and ordered alphabetically), we would have K(A, B) if and only if K(A, C) if and only if K(B, C), but not K(A, B) if and only if K(B, A).

Order-indiscernables feature prominently in the theory of Ramsey cardinals and Erdos cardinals.

Historically, the identity of indiscernibles was one of the laws of thought of Gottfried Leibniz.

[edit] See also

• Rough set