Added to Favorites

Related Searches

Definitions

Nearby Words

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 indiscernible, 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).## See also

It is also common to consider "order-indiscernibles", which possess a total ordering, and satisfy relations dependent only on the relative order of the arguments. If the set above were only order-indiscernible (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-indiscernibles feature prominently in the theory of Ramsey cardinals, Erdős cardinals, and Zero sharp.

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

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday March 19, 2008 at 03:35:14 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday March 19, 2008 at 03:35:14 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.