Displaying similar documents to “An axiomatization of the lattice of higher relative commutants of a subfactor.”

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli (2022)

Archivum Mathematicum

Similarity:

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups,...