Indiscernibles

In mathematical logic, indiscernibles are objects that 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.

gollark: They USED to.
gollark: Anyway, mind-reading is entirely doable but unfortunately most people's minds contain annoying irrelevant content rather than the specifics of the search query they just made.
gollark: Well, Google and Bing have 18246184618746128471289471289 employees ~~who actually know what they're doing~~ and postgres is likely better than the simple thing OSEv1 used.
gollark: What? No. Search engines are hard.
gollark: osmarks.net™ search engine™ plus™ will of course:- have working crawler logic probably- be faster somehow, as opposed to slower- use postgres FTS instead of a homegrown and not very good inverted index

See also

References

  • Jech, Thomas (2003). Set Theory. Springer Monographs in Mathematics (Third Millennium ed.). Berlin, New York: Springer-Verlag. ISBN 978-3-540-44085-7. Zbl 1007.03002.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.