English
Related papers

Related papers: Multisorted Boolean Clones Determined by Binary Re…

200 papers

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

Rings and Algebras · Mathematics 2007-05-23 Michael Pinsker

A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…

Logic in Computer Science · Computer Science 2019-09-09 Matthew Moore

The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary…

Rings and Algebras · Mathematics 2021-02-04 Erkko Lehtonen

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Logic · Mathematics 2007-05-23 Michael Pinsker

We determine all majority operations on a four-element set that generate a minimal clone.

Rings and Algebras · Mathematics 2011-02-09 Tamás Waldhauser

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

The near-unanimity-closed minions of Boolean functions, i.e., the clonoids whose target algebra contains a near-unanimity function, are completely described. The key concept towards this result is the minorant-minor partial order and its…

Rings and Algebras · Mathematics 2024-12-02 Erkko Lehtonen

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić

Every clone of functions comes naturally equipped with a topology---the topology of pointwise convergence. A clone $\mathfrak{C}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{C}$ of clones, if every…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.

Rings and Algebras · Mathematics 2008-07-02 Mathias Beiglböck , Martin Goldstern , Lutz Heindorf , Michael Pinsker

Recently Yang-Roh-Jun introduced the notion of ordered BCI-algebras as a generalization of BCI-algebras. They also introduced the notions of homomorphisms and kernels of ordered BCI-algebras and investigated related properties. Here we…

Rings and Algebras · Mathematics 2023-07-24 Eunsuk Yang , Eun Hwan Roh , Young Bae Jun

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

Logic in Computer Science · Computer Science 2009-07-28 Zhaohua Luo

A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…

Rings and Algebras · Mathematics 2008-01-15 Martin Goldstern , Michael Pinsker

The structure of the lattice of clones on a finite set has been proven to be very complex. To better understand the top of this lattice, it is important to provide a characterization of submaximal clones in the lattice of clones. It is…

Rings and Algebras · Mathematics 2017-07-28 Luc E. F. Diekouam , Etienne R. A. Temgoua , Marcel Tonga

Let c be the cardinality of the continuum. We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations. We also give, for each n, a family…

Rings and Algebras · Mathematics 2011-08-16 Martin Goldstern , Gábor Sági , Saharon Shelah

We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…

Logic in Computer Science · Computer Science 2015-05-28 Samuel Mimram

We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. We characterize the minor homomorphism posets of finite algebras in terms of disjoint unions of dual…

Combinatorics · Mathematics 2022-03-14 Wolfgang Poiger , Bruno Teheux

We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…

Category Theory · Mathematics 2011-10-17 Richard Garner

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar