Nov 28, 2018 · We prove that whenever \Gamma contains at least one non-empty relation distinct from the full carrier set, there is a countably infinite number ...

Dec 19, 2018 · Combining Theorem 16 and Proposition 17 we can pinpoint the exact number of clones determined by disjunctions of non-trivial unary relations ...

Nov 28, 2018 · Our main result is that for any finite non-trivial set of unary relations Γ on any carrier set, there are exactly ℵ0-many polymorphism clones ...

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 ...

Behrisch, M., Vargas-García, E., & Zhuk, D. (2018). The Number of Clones Determined by Disjunctions of Unary Relations. Theory of Computing Systems, 63(6), ...

We prove that whenever Γ contains at least one non-empty relation distinct from the full carrier set, there is a countably infinite number of polymorphism ...

The number of clones determined by disjunctions of unary relations. Theory of Computing Systems. 2019. Vol. 63. No. 6. P. 1298-1313. Behrisch M., Vargas ...

The number of clones determined by disjunctions of unary relations. M Behrisch, E Vargas-García, D Zhuk. Theory of Computing Systems 63, 1298-1313, 2019. 2 ...

An algebraic theory of clones. Article 20 March 2022. The Number of Clones Determined by Disjunctions of Unary Relations. Article Open access 19 December 2018.

The C-subfunction relations defined by clones that contain all unary operations on a finite base set are examined. For each such clone it is determined whether ...