Pseudocomplemented lattice effect algebras and existence of states

We prove that in every pseudocomplemented atomic lattice effect algebra the subset of all pseudocomplements is a Boolean algebra including the set of sharp elements as a subalgebra. As an application, we show families of effect algebras for which the existence of a pseudocomplementation implies the existence of states. These states can be obtained by smearing of states existing on the Boolean algebra of sharp elements.     

The pasting constructions of lattice ordered effect algebras

The aim of this paper is to present some ways of constructing a lattice ordered effect algebra from the given family of MV-algebras. The loop lemma of lattice ordered effect algebras is proved. Then the definitions of Greechie diagrams of effect algebras are given. All these results have generalized those of orthomodular lattices. As applications of loop lemma and Greechie diagrams, some lattice ordered effect algebras without states are presented.     

Ideals and quotients in lattice ordered effect algebras

 We show that a quotient of a lattice ordered effect algebra L with respect to a Riesz ideal I is linearly ordered if and only if I is a prime ideal, and the quotient is an MV-algebra if and only if I is an intersection of prime ideals. A generalization of the commutators in OMLs is defined in the frame of lattice ordered effect algebras, such that the quotient with respect to a Riesz ideal I is an MV-algebra if and only if I contains all generalized commutators. If L is an OML, generalized commutators coincide with the usual Marsden commutators.     

Congruences generated by ideals of the compatibility center of lattice effect algebras

We prove that for every lattice effect algebra, the system of all congruences generated by the prime ideals of the compatibility center separates the elements. This is a common generalization of Chang’s representation theorem from 1959 and a result of Graves and Selesnick (Colloq Math 27:21–30, 1973).     

Lack of associative filters in lattice implication algebras

Jun et al. (Bull Korean Math Soc 35(1):53–61, 1998) introduced the notion of associative filters in lattice implication algebra and studied some of its properties. In this paper, we show that there is no associative filter in lattice implication algebra.     

Congruences and ideals in pseudo effect algebras as total algebras

Congruences and ideals in pseudo-effect algebras and their total algebra versions are studied. It is shown that every congruence of the total algebra induces a Riesz congruence in the corresponding pseudo-effect algebra. Conversely, to every normal Riesz ideal in a pseudo-effect algebra there is a total algebra, in which the given ideal induces a congruence of the total algebra. Ideals of total algebras corresponding to lattice-ordered pseudo-effect algebras are characterized, and it is shown that they coincide with normal Riesz ideals in the pseudo-effect algebras.     

On BCK algebras: Part II: New algebras. The ordinal sum (product) of two bounded BCK algebras

Since all the algebras connected to logic have, more or less explicitly, an associated order relation, it follows, by duality principle, that they have two presentations, dual to each other. We classify these dual presentations in “left” and “right” ones and we consider that, when dealing with several algebras in the same research, it is useful to present them unitarily, either as “left” algebras or as “right” algebras. In some circumstances, this choice is essential, for instance if we want to build the ordinal sum (product) between a BL algebra and an MV algebra. We have chosen the “left” presentation and several algebras of logic have been redefined as particular cases of BCK algebras. We introduce several new properties of algebras of logic, besides those usually existing in the literature, which generate a more refined classification, depending on the properties satisfied. In this work (Parts I–V) we make an exhaustive study of these algebras—with two bounds and with one bound—and we present classes of finite examples, in bounded case. In Part II, we continue to present new properties, and consequently new algebras; among them, bounded α γ algebra is a common generalization of MTL algebra and divisible bounded residuated lattice (bounded commutative Rl-monoid). We introduce and study the ordinal sum (product) of two bounded BCK algebras. Dedicated to Grigore C. Moisil (1906–1973).     

格蕴涵代数中的极小素理想及α-理想

在格蕴涵代数中,证明了极小素理想与极小格素理想的等价性,继而给出了极小素理想与零化子的相互表示定理。提出了格蕴涵代数中的[α]-理想概念并给出其若干等价刻画,证明了极小素理想是[α]-理想。证明了全体素[α]-理想之集[Sα(L)]是一个紧的Stone空间,进一步给出[Sα(L)]分别是[T1、][T2]拓扑空间的充要条件。     

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected and weakly connected dominating sets whose size is at most times the optimum, Δ being the maximum degree of the input network. This is best-possible if and if the processors are required to run in polynomial-time. We then show how to construct dominating sets that have the above properties, as well as the “low stretch” property that any two adjacent nodes in the network have their dominators at a distance of at most in the output network. (Given a dominating set S, a dominator of a vertex u is any v∈S such that the distance between u and v is at most one.) We also show our time bounds to be essentially optimal.     

G(o)del语言类型系统

G(o)del语言是一种说明性逻辑程序设计语言.该语言基于一阶逻辑,引入了一个多态多类的类型系统和多种新的语言成分,支持抽象数据类型和模块化程序设计等技术,语言本身也具有很强的说明性语义.详细介绍了G(o)del语言的类型系统及其构造,对在逻辑程序设计语言中引入类型系统的作用进行了一些深入的分析和讨论.     

Implementation of meronymic (part-whole) inheritance for semantic networks

Studies in the field of cognitive science have demonstrated the existence of a taxonomy of meronymic (part-whole) relations, each of which corresponds to a meaning of the English phrase ‘part of’. It is proposed here that equivocations between meronymic and other types of semantic relations can be a source of ambiguity during knowledge elicitation, and are, in some part, responsible for the confusing plethora of types of is_a link to be found in current knowledge-based system environments. Based on the taxonomy of part-whole relations, a general-purpose implementation, and applications of meronymic inheritance for a Rule Based Frame System, are presented.     

About permutation algebras, (pre)sheaves and named sets

In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)sheaf categories, nominal sets, permutation algebras and named sets, studying the relationships among these models, thus allowing techniques and constructions to be transferred from one model to the other. Research partially supported by the EU IST-2004-16004 SENSORIA.     

Wajsberg algebras of order $$n (nle 9)$$

Neural Computing and Applications - Knowing the applications of logical algebras in various fields, such as artificial intelligence or coding theory, in this paper, we study some properties of a...     

n值GÖdel逻辑系统中的随机化研究

利用赋值集的随机化方法,在n值GÖdel逻辑系统中提出了公式的随机真度,证明了所有公式的随机真度集在[0,1]中没有孤立点;给出了两公式间的D_Gn-相似度与伪距离的概念,并建立了D_Gn-逻辑度量空间,证明了此空间没有孤立点.     

Riesz ideals in generalized pseudo effect algebras and in their unitizations

We prove that there is an order isomorphism between the lattice of all normal Riesz ideals and the lattice of all Riesz congruences in upwards directed generalized pseudoeffect algebras (or GPEAs, for short). We give a sufficient and necessary condition under which a normal Riesz ideal I of a weak commutative generalized pseudoeffect algebra P is a normal Riesz ideal also in the unitization [^(P)]\widehat{P} of P. These results extend those obtained recently by Avalllone, Vitolo, Pulmannová and Vinceková for effect algebras. At the same time, we give the conditions under which the quotient of a generalized pseudoeffect algebra P is a generalized effect algebra and linearly ordered generalized pseudoeffect algebra.     

Cooling of SU(3) lattice gauge field configurations

A method to cool SU(3) lattice gauge field configurations is discussed. It locally minimizes the mean plaquette. The cooled configurations can be used to compute the η′-mass in QCD, using Witten's formula connecting this mass to the topological susceptibility.     

R(o)sler三维混沌系统在图像加密巾的应用

基于R(o)ssler系统的三维混沌序列设计了一种既改变像素位置又改变像素灰度值的图像加密方法.使用R(o)ssler三维混沌序列中的任意两维混沌序列控制像素的旋转与置换,剩下的一维序列变换像素的灰度.并且在R(o)ssler混沌加密密钥的基础上,增加了置乱密钥,提升了密钥空间,方便了密钥管理.对比Chebyshev映射实现的空域复合加密方法,仿真实验表明该加密方案加密时间短、效率高、安全性好且易于实现.