Partial automorphism semigroups
Annals of Pure and Applied Logic(2008)
摘要
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.
更多查看译文
关键词
03C07,03D45,03G10,08A35
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要