• Source: 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



β


{\displaystyle \beta }

, we must have




[
β
(
a
,
b
)
∧
β
(
b
,
a
)
∧
β
(
a
,
c
)
∧
β
(
c
,
a
)
∧
β
(
b
,
c
)
∧
β
(
c
,
b
)
]
∨


{\displaystyle [\beta (a,b)\land \beta (b,a)\land \beta (a,c)\land \beta (c,a)\land \beta (b,c)\land \beta (c,b)]\lor }





[
¬
β
(
a
,
b
)
∧
¬
β
(
b
,
a
)
∧
¬
β
(
a
,
c
)
∧
¬
β
(
c
,
a
)
∧
¬
β
(
b
,
c
)
∧
¬
β
(
c
,
b
)
]

.


{\displaystyle [\lnot \beta (a,b)\land \lnot \beta (b,a)\land \lnot \beta (a,c)\land \lnot \beta (c,a)\land \lnot \beta (b,c)\land \lnot \beta (c,b)]\,.}


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




(
[
φ
(
a
,
b
)
∧
φ
(
a
,
c
)
∧
φ
(
b
,
c
)
]
∨
[
¬
φ
(
a
,
b
)
∧
¬
φ
(
a
,
c
)
∧
¬
φ
(
b
,
c
)
]
)


{\displaystyle ([\varphi (a,b)\land \varphi (a,c)\land \varphi (b,c)]\lor [\lnot \varphi (a,b)\land \lnot \varphi (a,c)\land \lnot \varphi (b,c)])}

and




(
[
φ
(
b
,
a
)
∧
φ
(
c
,
a
)
∧
φ
(
c
,
b
)
]
∨
[
¬
φ
(
b
,
a
)
∧
¬
φ
(
c
,
a
)
∧
¬
φ
(
c
,
b
)
]
)

.


{\displaystyle ([\varphi (b,a)\land \varphi (c,a)\land \varphi (c,b)]\lor [\lnot \varphi (b,a)\land \lnot \varphi (c,a)\land \lnot \varphi (c,b)])\,.}


More generally, for a structure





A




{\displaystyle {\mathfrak {A}}}

with domain



A


{\displaystyle A}

and a linear ordering



<


{\displaystyle <}

, a set



I
⊆
A


{\displaystyle I\subseteq A}

is said to be a set of



<


{\displaystyle <}

-indiscernibles for





A




{\displaystyle {\mathfrak {A}}}

if for any finite subsets



{

i

0


,
…
,

i

n


}
⊆
I


{\displaystyle \{i_{0},\ldots ,i_{n}\}\subseteq I}

and



{

j

0


,
…
,

j

n


}
⊆
I


{\displaystyle \{j_{0},\ldots ,j_{n}\}\subseteq I}

with




i

0


<
…
<

i

n




{\displaystyle i_{0}<\ldots
and




j

0


<
…
<

j

n




{\displaystyle j_{0}<\ldots
and any first-order formula



ϕ


{\displaystyle \phi }

of the language of





A




{\displaystyle {\mathfrak {A}}}

with



n


{\displaystyle n}

free variables,





A


⊨
ϕ
(

i

0


,
…
,

i

n


)

⟺



A


⊨
ϕ
(

j

0


,
…
,

j

n


)


{\displaystyle {\mathfrak {A}}\vDash \phi (i_{0},\ldots ,i_{n})\iff {\mathfrak {A}}\vDash \phi (j_{0},\ldots ,j_{n})}

.p. 2




Applications


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




See also


Identity of indiscernibles
Rough set




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.




= Citations

=

Kata Kunci Pencarian:

• Nilai absolut
• Alam semesta
• Identity of indiscernibles
• Indiscernibles
• Zero sharp
• Covering lemma
• Equality (mathematics)
• Leibniz' law
• Substance theory
• Gonzalo Rodriguez-Pereyra
• Property (philosophy)
• Max Black