Abstract

Two cardinals are said to beindistinguishableif there is no sentence of second order logic which discriminates between them. This notion, which is defined precisely below, is closely related to that ofcharacterizablecardinals, introduced and studied by Garland in [3]. In this paper we give an algebraic criterion for two cardinals to be indistinguishable. As a consequence we obtain a straightforward proof of an interesting theorem about characterizable cardinals due to Zykov [6].