Definability in substructure orderings, IV: Finite lattices
暂无分享,去创建一个
Let $${\mathcal{L}}$$ be the ordered set of isomorphism types of finite lattices, where the ordering is by embeddability. We study first-order definability in this ordered set. Our main result is that for every finite lattice L, the set {ℓ, ℓopp} is definable, where ℓ and ℓopp are the isomorphism types of L and its opposite (L turned upside down). We shall show that the only non-identity automorphism of $${\mathcal{L}}$$ is the map $${\ell \mapsto \ell^{\rm opp}}$$.
[1] Jaroslav Jezek,et al. Definability in Substructure Orderings, II: Finite Ordered Sets , 2010, Order.
[2] Ralph McKenzie,et al. Definability in substructure orderings, III: Finite distributive lattices , 2009 .
[3] James B. Nation,et al. Lattices with large minimal extensions , 2001 .
[4] R. McKenzie,et al. Definability in substructure orderings, I: finite semilattices , 2009 .