2000 character limit reached
The number of clones determined by disjunctions of unary relations
Published 28 Nov 2018 in math.LO and math.RA | (1811.11737v1)
Abstract: We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set $\Gamma$. We prove that whenever $\Gamma$ contains at least one non-empty relation distinct from the full carrier set, there is a countably infinite number of polymorphism clones determined by relations that are disjunctively definable from $\Gamma$. Finally, we extend our result to finitely related polymorphism clones and countably infinite sets $\Gamma$.
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.