Related papers: Functional reducts of Boolean algebras
Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
In this paper we give the classification of the irreducible non solvable Lie algebras of dimensions $\leq 13$ with nondegenerate, symmetric and invariant bilinear forms.
We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…
In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…
We construct an algebra of dimension $2^{\aleph_0}$ consisting only of functions which in no point possess a finite one-sided derivative. We further show that some well known nowhere differentiable functions generate algebras, which contain…
The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a…
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas…
In this paper, we classify the function space of all real-valued functions on R denoted as F(R, R) into 28 distinct blocks. Each block contains elements that share common features in terms of the cardinality of their sets of continuity and…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
Let $p$ be a nonzero complex number. Recently, a class of infinite rank Lie conformal algebras $\mathfrak{B}(p)$ was introduced in [13]. In this paper, we study the structure theory of this class of Lie conformal algebras. Specifically, we…
This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Algebraically constructible functions connect real algebra with the topology of algebraic sets. In this survey we present some history, definitions, properties, and algebraic characterizations of algebraically constructible functions, and a…
In the present paper, we endow the logics of topological quasi Boolean algebras, topological quasi Boolean algebras 5, intermediate algebras of types 1-3, and pre-rough algebras with proper multi-type display calculi which are sound,…
The structure of quotient Boolean algebras in terms of cardinal invariants is investigated. Some results of Gitik and Shelah regarding atomless ideals are reproved and proofs are significantly simplified.