Reducibility in finite posets (Q5927686)

Let \(P\) be a poset belonging to a class of finite posets with \(0\). An element \(x\in P\) is called deletable if \(P\setminus\{x\}\) belongs to the same class as \(P\). A class of posets is reducible if each poset of this class has a deletable element. The authors characterize elements deletable in upper semimodular posets and prove that the class of upper semimodular posets is not reducible. Further, they solve an analogous problem for the class of pseudocomplemented posets.