Related papers: On a quasi-ordering on Boolean functions
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
We present an order-theoretical fixed point theorem for increasing multivalued operators suitable for the method of sub-supersolutions and its application to the following multivalued quasi-variational inclusion: Let $\Omega \subset \mathbb…
We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…
It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We recall the definition of quasinearly subharmonic functions, point out that this function class includes, among others, subharmonic functions, quasisubharmonic functions, nearly subharmonic functions and essentially almost subharmonic…
Recently introduced by the authors in [Proc. Edinb. Math. Soc. 60 (2020), 139-167], quasi-densities form a large family of real-valued functions partially defined on the power set of the integers that serve as a unifying framework for the…
The standard model of quantum circuits assumes operations are applied in a fixed sequential "causal" order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant…
A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…
We give a characterization for two different concepts of quasi-analyticity in Carleman ultraholomorphic classes of functions of several variables in polysectors. Also, working with strongly regular sequences, we establish generalizations of…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
For a Boolean function $\Phi\colon\{0,1\}^d\to\{0,1\}$ and an assignment to its variables $\mathbf{x}=(x_1, x_2, \dots, x_d)$ we consider the problem of finding the subsets of the variables that are sufficient to determine the function…
Quasianalytic classes are classes of infinitely differentiable functions that satisfy the analytic continuation property enjoyed by analytic functions. Two general examples are quasianalytic Denjoy-Carleman classes (of origin in the…
Classes SSGP(n)(n < \omega) of topological groups are defined, and the class-theoretic inclusions SSGP(n) \subseteq SSGP(n+1) \subseteq m.a.p. are established and shown proper. These classes are investigated with respect to the properties…
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.
In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…
In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…