Partial automorphism semigroups

Abstract. We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism (elementary equivalence) of the subsemigroups yields isomorphism (elementary equivalence) of the underlying structures. We also prove that for some classes of computable structures, we can reconstruct a computable structure, up to computable isomorphism, from the isomorphism type of its inverse semigroup of computable partial automorphisms.

• Type: Journal
• Year: 2008
• Where: APAL
• Authors: Jennifer Chubb, Valentina S. Harizanov, Andrei S. Morozov, Sarah Pingrey, Eric Ufferman
• Keywords: APAL 2008, Elementary Equivalence, Inverse Semigroup, Partial Automorphisms