Definability in substructure orderings. I: Finite semilattices (Q1040653)

Let \(K\) be a fixed class of structures of some given finite signature. Consider the collection \(L\) of all subclasses of \(K\) that are axiomatizable by a selected type \(T\) of axioms. This collection is usually a complete lattice with respect to inclusion. Let us say that \(L\) has \textit{positive definability} if one can prove the following statements: (1) the collection of all finitely \(T\)-axiomatizable subclasses of \(K\) is a definable subset of \(L\) and every element of that collection is definable in \(L\) up to the automorphisms of \(L\); (2) the collection of all finitely generated \(T\)-subclasses of \(K\) is a definable subset of \(L\) and every element of that collection is definable in \(L\) up to the automorphisms of \(L\); (3) the collection of the subclasses of \(K\) that are axiomatizable by a single \(T\)-axiom is a definable subset of \(L\); (4) \(L\) has no other automorphisms than the obvious, syntactically defined ones. In this paper, the authors investigate definability in the set of isomorphism types of finite semilattices ordered by embeddability; they prove, among other things, that every finite semilattice is a definable element in this ordered set. Then they apply these results to investigate definability in the closely related lattice of universal classes of semilattices; also, they prove that the lattice has no non-identical automorphisms, the set of finitely generated universal classes and also the set of finitely axiomatizable universal classes are definable subsets and each element of the two subsets is a definable element in the lattice.