相关论文: Clones on infinite sets

Let $X$ be an arbitrary set and let $T(X)$ denote the full transformation monoid on $X$. We prove that an element of $T(X)$ is unit-regular if and only if it is semi-balanced. For infinite $X$, we discuss regularity of the submonoid of…

The main problem of clone theory is to describe the clone lattice for a given basic set. For a two-element basic set this was resolved by E.L. Post, but for at least three-element basic set the full structure of the lattice is still…

We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…

We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative…

For every well founded tree $\mathcal{T}$ having a unique root such that every non-maximal node of it has countable infinitely many immediate successors, we construct a $\mathcal{L}_\infty$-space $X_{\mathcal{T}}$. We prove that for each…

Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

Let A be a finite set with at least two elements. The composition of two classes I and J of operations on A, is defined as the set of all compositions of functions in I with functions in J. This binary operation gives a monoid structure to…

The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.

For any infinite subset $X$ of the rationals and a subset $F \subseteq X$ which has no isolated points in $X$ we construct a function $f: X \to X$ such that $f(f(x))=x$ for each $x\in X$ and $F $ is the set of discontinuity points of $f$.

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Let G be a closed subgroup of the group of all permutations of a countably infinite set. Let X be a Polish G-space with a countable basis A of clopen sets. Each x from X defines a characteristic function f on A by f(U)=1 iff x belongs to U…

We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of…

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…

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

An ideal on a set $X$ is a collection of subsets of $X$ closed under the operations of taking finite unions and subsets of its elements. Ideals are a very useful notion in topology and set theory and have been studied for a long time. We…

Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\mathscr C$ be a class of finite combinatorial structures, the \emph{profile} of $\mathscr C$ is the function $\varphi_{\mathscr C}$…