IMTL代数上的素布尔模糊滤子及其运算

在IMTL代数M的全体素布尔模糊滤子集ゐゐ(M)∪{φ}上定义格运算和逆序对合对应,证明ゐゐ(M)∪{φ}在这些运算下是一个完备的有逆序对合对应的有界分配格(即是一个完备的拟布尔代数).然后再在ゐゐ(M)∪{φ}上定义一个伴绥对,证明ゐゐ(M)∪{φ}也构成一个剩余格.     

Separation of clones of cooperations by cohyperidentities

An n-ary cooperation is a mapping from a nonempty set A to the nth copower of A. A clone of cooperations is a set of cooperations which is closed under superposition and contains all injections. Coalgebras are pairs consisting of a set and a set of cooperations defined on this set. We define terms for coalgebras, coidentities and cohyperidentities. These concepts will be applied to give a new solution of the completeness problem for clones of cooperations defined on a two-element set and to separate clones of cooperations by coidentities.     

Equivalence of operations with respect to discriminator clones

For each clone C on a set A there is an associated equivalence relation, called C-equivalence, on the set of all operations on A, which relates two operations iff each one is a substitution instance of the other using operations from C. In this paper we prove that if C is a discriminator clone on a finite set, then there are only finitely many C-equivalence classes. Moreover, we show that the smallest discriminator clone is minimal with respect to this finiteness property. For discriminator clones of Boolean functions we explicitly describe the associated equivalence relations.     

Realization of Boolean functions by repetition-free formulas in a particular base

Siberian Mathematical Journal - Under study are the representations of Boolean functions by formulas. We offer a criterion for the Boolean functions to be repetition-free in the base {V,·,...     

The fraction of large random trees representing a given Boolean function in implicational logic

We consider the logical system of Boolean expressions built on the single connector of implication and on positive literals. Assuming all expressions of a given size to be equally likely, we prove that we can define a probability distribution on the set of Boolean functions expressible in this system. Then we show how to approximate the probability of a function f when the number of variables grows to infinity, and that this asymptotic probability has a simple expression in terms of the complexity of f. We also prove that most expressions computing any given function in this system are “simple”, in a sense that we make precise. The probability of all read‐once functions of a given complexity is also evaluated in this model. At last, using the same techniques, the relation between the probability of a function and its complexity is also obtained when random expressions are drawn according to a critical branching process. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

A subclass of Ockham algebras

Here we introduce a subclass of the class of Ockham algebras ( L ; f ) for which L satisfies the property that for every x ∈ L , there exists n ≥ 0 such that fn ( x ) and fn+1 ( x ) are complementary. We characterize the structure of the lattice of congruences on such an algebra ( L ; f ). We show that the lattice of compact congruences on L is a dual Stone lattice, and in particular, that the lattice Con L of congruences on L is boolean if and only if L is finite boolean. We also show that L is congruence coherent if and only if it is boolean. Finally, we give a sufficient and necessary condition to have the subdirectly irreducible chains.     

Bernstein-Kantorovich算子的迭代布尔和的逼近性质

本文利用光滑模及最佳逼近多项式的性质,研究了Bernstein-Kantorovich算子的迭代布尔和对Lp[0,1]中的函数的逼近性质,得到了逼近正定理,弱逆不等式及等价定理.