1. Examples

2. Generalizations

3. Applications

4. See also

5. References

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.

Examples

If a, b, and c are distinct and {a, b, c} is a set of indiscernibles, then, for example, for each binary formula , we must have

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

Generalizations

In some contexts one considers the more general notion of order-indiscernibles, and the term sequence of indiscernibles often refers implicitly to this weaker notion. In our example of binary formulas, to say that the triple (a, b, c) of distinct elements is a sequence of indiscernibles implies

Applications

Order-indiscernibles feature prominently in the theory of Ramsey cardinals, Erdős cardinals, and Zero sharp.

See also

• Rough set

References

• {{cite book | last1=Jech | first1=Thomas | author1-link=Thomas Jech | title=Set Theory | edition=Third Millennium | publisher=Springer-Verlag | location=Berlin, New York | series=Springer Monographs in Mathematics | isbn=978-3-540-44085-7 | year=2003 | zbl=1007.03002 }}

• Streamliner buses
• Streamliner car
• Streamliner cars
• Streamliner diner
• Streamliner diners
• Streamliner motorcycle
• Streamliner ship
• Streamliner ships
• Streamliner streetcar
• Streamliner streetcars
• Streamliner trailer
• Streamliner trailers
• Streamliner trainset
• Streamliner trainsets
• Streamline Tower
• Streamlining theory
• Streamlining Theory
• Stream monkey flower
• Stream monkey-flower
• Stream of Thought
• Stream pollution
• Stream Protection Rule
• Stream protection rule
• Stream ruby
• Stream Ruby