相关论文: Clones on infinite sets

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

It was showed by Donner in 1982 that every order complete vector lattice $X$ may be embedded into a cone $X^s$, called the sup-completion of $X$. We show that if one represents the universal completion of $X$ as $C^\infty(K)$, then $X^s$ is…

We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion…

We investigate the finitary functions from a finite product of finite fields $\prod_{j =1}^m\mathbb{F}_{q_j} = \mathbb{K}$ to a finite product of finite fields $\prod_{i =1}^n\mathbb{F}_{p_i} = \mathbb{F}$, where $|\mathbb{K}|$ and…

We conjecture that every infinite group $G$ can be partitioned into countably many cells $G=\bigcup_{n\in\omega}A_n$ such that $cov(A_nA_n^{-1})=|G|$ for each $n\in\omega$. Here $cov(A)=\min\{|X|:X\subseteq G, G=XA\}$. We confirm this…

We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.

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…

For a set $x$, let $\mathcal{S}(x)$ be the set of all permutations of $x$. We study several aspects of this notion in $\mathsf{ZF}$. The main results are as follows: (1) $\mathsf{ZF}$ proves that for all sets $x$, if $\mathcal{S}(x)$ is…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Code clones are pairs of code snippets that implement similar functionality. Clone detection is a fundamental branch of automatic source code comprehension, having many applications in refactoring recommendation, plagiarism detection, and…

An important classical result in ZFC asserts that every infinite cardinal number is idempotent. Using this fact, we obtain several algebraic results in this article. The first result asserts that an infinite Abelian group has a proper…

For any set $X$, ${\mathcal P}(X)$ denotes the collection of all subsets of $X$, ordered by inclusion. A {\it cutset} in ${\mathcal P}(X)$ is a subset of ${\mathcal P}(X)$ which meets every maximal chain of ${\mathcal P}(X)$. A cutset is…

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…