Related papers: On a quasi-ordering on Boolean functions
Arithmetic quasi-densities are a large family of real-valued set functions partially defined on the power set of $\mathbb{N}$, including the asymptotic density, the Banach density, the analytic density, etc. Let $B \subseteq \mathbb{N}$ be…
We introduce an extension of the multi-instance learning problem where examples are organized as nested bags of instances (e.g., a document could be represented as a bag of sentences, which in turn are bags of words). This framework can be…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…
Recently Bishop constructed the first example of a bounded-type transcendental entire function with a wandering domain using a new technique called quasiconfomal folding. It is easy to check that his method produces an entire function of…
We obtain order estimates of approximation of functions from the classes $S^{\Omega}_{p,\theta}B (\mathbb{R}^d)$ in the space $L_q(\mathbb{R}^d)$, $1<p<q<\infty$, by entire functions of exponential type with supports of their Fourier…
Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…
We consider countable so-called rich subsemigroups of (\omega\omega,\circ); each such semigroup $T$ gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of \omega-dimensional…
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…
A quandle will be called quasi-affine, if it embeds into an affine quandle. Our main result is a characterization of quasi-affine quandles, by group-theoretic properties of their displacement group, by a universal algebraic condition coming…
It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…
We extend the notion of amoeba to holomorphic almost periodic functions in tube domains. In this setting, the order of a function in a connected component of the complement to its amoeba is just the mean motion of this function. We also…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every…
In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable…
We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…
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…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…