Related papers: Self-full ceers and the uniform join operator
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…
We propose a definition of a non-invertible symmetry enriched topological order (NI-SETO), and we implement our definition for string net models. We do so in two ways, using full inclusions of unitary fusion categories (UFCs), as well as…
Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
The notion of a shift-compact set in an abelian topological group $X$ plays a significant role in functional equations and inequalities, especially so since each Borel set that is not Haar-meagre, alternatively not Haar-null, is necessarily…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
There is an explicit formula expressing the Chern-Schwartz-MacPherson class of a hypersurface in a nonsingular variety (in characteristic $0$) in terms of the Segre class of its jacobian subscheme; this has been known for a number of years.…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction…
For a restricted Lie algebra $L$, the conditions under which its restricted enveloping algebra $u(L)$ is semiperfect are investigated. Moreover, it is proved that $u(L)$ is left (or right) perfect if and only if $L$ is finite-dimensional.
Let $X$ be any rational surface. We construct a tilting bundle $T$ on $X$. Moreover, we can choose $T$ in such way that its endomorphism algebra is quasi-hereditary. In particular, the bounded derived category of coherent sheaves on $X$ is…
Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$.…
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for $\SI 1$, the…
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…