Related papers: On a quasi-ordering on Boolean functions
We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…
We construct bases of quasi-symmetric functions whose product rule is given by the shuffle of binary words, as for multiple zeta values in their integral representations, and then extend the construction to the algebra of free…
The underlying theme of this article is a class of sequences in metric structures satisfying a much weaker kind of Cauchy condition, namely quasi-Cauchy sequences (introduced in \cite{bc}) that has been used to define several new concepts…
The main aim of this paper is to consider the classes of quasi-asymptotically almost periodic functions and Stepanov quasi-asymptotically almost periodic functions in Banach spaces. These classes extend the well known classes of…
We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…
We unify functional and logic programming by treating predicatesas functions equipped with their support: the set of inputs whose output is nonzero. Datalog, for instance, is a language of finitely supported boolean functions. Finite…
We study several bialgebraic structures on boolean functions, that is to say maps defined on the set of subsets of a finite set $X$, taking the value $0$ on $\emptyset$. Examples of boolean functions are given by the indicator function of…
Let $\cl{M}$ be a Hilbert module of holomorphic functions over a natural function algebra $\mathcal{A}(\Omega)$, where $\Omega \subseteq \bb{C}^m$ is a bounded domain. Let $\cl{M}_0\subseteq \cl{M}$ be the submodule of functions vanishing…
We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…
Let $\Omega\subset \mathbb C^n$ be a bounded domain, and let $f$ be a real-valued function defined on the whole topological boundary $\partial \Omega$. The aim of this paper is to find a characterization of the functions $f$ which can be…
We give a new characterization of the Baire class 1 functions (defined on an ultrametric space) by proving that they are exactly the pointwise limits of sequences of full functions (which are particularly simple Lipschitz functions).…
In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or…
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…
We study Boolean classification problems over relational background structures in the logical framework introduced by Grohe and Tur\'an (TOCS 2004). It is known (Grohe and Ritzert, LICS 2017) that classifiers definable in first-order logic…
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
In unbounded subset $\Omega$ in $R^n$ we study the operator $u\rightarrow gu$ as an operator defined in the Sobolev space $W^{r,p}(\Omega)$ and which takes values in $L^p(\Omega)$. The functions $g$ belong to wider spaces of $L^p$ connected…