Related papers: Weak Bases of Boolean Co-Clones
We survey systematic approaches to basis-restricted fragments of propositional logic and modal logics, with an emphasis on how expressive power and computational complexity depend on the allowed operators. The propositional case is…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
A non-unital generalization of weak bialgebra is proposed with a multiplier-valued comultiplication. Certain canonical subalgebras of the multiplier algebra (named the `base algebras') are shown to carry coseparable co-Frobenius coalgebra…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…
We present a lattice analysis of a confining Yang-Mills theory without Goldstone boson. We have analytically investigated the model by a strong coupling expansion and by an intensive lattice Monte Carlo simulation using standard lattice QCD…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
The main problem of clone theory is to describe the clone lattice for a given basic set. For a two-element basic set this was resolved by E.L. Post, but for at least three-element basic set the full structure of the lattice is still…
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base…
In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…
In the framework of computational complexity and in an effort to define a more natural reduction for problems of equivalence, we investigate the recently introduced kernel reduction, a reduction that operates on each element of a pair…
The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\mathbf{2} := \{0,1\}$, the set $\mathcal{I}(C)$ of all partial clones on $\mathbf{2}$ whose total component is $C$, is either finite or…