2000 character limit reached
Deciding absorption
Published 22 Dec 2015 in math.RA and cs.CC | (1512.07009v1)
Abstract: We characterize absorption in finite idempotent algebras by means of J\'onsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.