Partial automorphism semigroups (Q998310)

The partial automorphisms of an algebraic structure form an inverse semigroup, meaning that for every element \(x\) there exists an element \(x^{-1}\) such that \(x = x x^{-1} x\) and \(x^{-1} = x^{-1} x x^{-1}\). The paper investigates such inverse semigroups for the following structures: equivalence structures, partial orderings, Boolean algebras, and relatively complemented distributed lattices. There are two types of results. Results of the first type show that for certain subsemigroups of these inverse semigroups, isomorphism of the subsemigroups imply isomorphism of the underlying structure. Results of the second type show that, in some cases, a computable structure can be reconstructed from the isomorphism type of its inverse semigroup of computable partial automorphisms.