generalized Boolean algebra

generalized Boolean algebra的基本解释

-

广义布尔代数

与generalized Boolean algebra相关的网络例句 [注：此内容来源于网络，仅供参考]

31 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Table 3-2 Distributivity Idempotency Absorption laws 分配律同一律吸收律 a=ab+ac a+= a+a=a aa=a a+ab=a a=a'=a'b''=a'+b' DeMorgan's laws德摩根定理计算机专业英语 3-32 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Since a finite set of n elements has exactly 2n subsets, and it can be shown that the finite Boolean algebras are precisely the finite set algebras, each finite Boolean algebra consists of exactly 2n elements for some integer n.

由于n个元素的有限集有且只有个子集由于个元素的有限集有且只有2n个子集，而且很显然有限布个元素的有限集有且只有个子集，尔代数一定是有限集合代数，所以对某个整数n而言而言，尔代数一定是有限集合代数，所以对某个整数而言，每个有限布尔代数也有且只有2n个元素。例如，上文定义的集合T的限布尔代数也有且只有个元素。

Using the theories of probability, algebra and spectral theory comprehensively, we investigate some related characteristics of logic functions in cryptography: Firstly, we introduce m order generalized s - correlation immunity of Boolean vector functions and prove that the higher order generalized ε- correlation immunity can guarantee the lower order generalized ε- correlation immunity. Then by applying decomposition formula of joint distribution of Boolean random vectors, we give a spectrum criterion of m order generalized e - correlation immunity of Boolean vector functions. Furthermore, we show that the algebraic degree of m order generalized e - correlation immune Boolean vector functions is not restricted by the correlation immune orders.

本文主要运用概率论的思想和方法，并结合代数学和频谱理论的相关知识，对密码学中逻辑函数的有关性质进行了研究，主要包括以下三个方面的内容：首先，对布尔向量函数的相关免疫性进行了拓展，给出了k维布尔向量函数m阶广义ε-相关免疫的概念，证明了布尔向量函数的高阶广义ε-相关免疫性蕴含低阶广义ε-相关免疫性，并根据布尔随机向量联合分布分解式得到了布尔向量函数m阶广义ε-相关免疫的一个谱判别条件，还说明了m阶广义ε-相关免疫布尔向量函数的代数次数不受相关免疫阶数的制约。

Based on the outcome of Xu Yang and Qin Keyun about lattice implication algebra and lattice-valued prepositional logic LP with truth-value in a lattice implication algebra, the author studied the properties of lattice implication algebra and the α-automated reasoning method based on α-resolution principle of LP. The specific contents are as follows: The Study of Lattice Implication Algebra On the basis of previous results of lattice implication algebra, this part consists of the following three points: 1. Some properties of lattice implication algebra L were discussed, and some important results were given if L was a complete lattice implication algebra. 2. The properties of left idempotent elements of lattice implication algebras were discussed, and the conclusion that lattice implication algebra L was equals of the directed sum of the range and dual kernel of a left map constructed by a left idempotent element was proved. 3. The properties of the filters of lattice implication algebra were discussed, the theorem was shown that they satisfy the hypothetical syllogism and substitute theorem of the propositional logic. 4. The concept of weak niters of lattice implication algebras and their properties and structures are discussed. It is proved that all weak filters of a lattice implication algebra form a topology and the the implication isomorphism betweem two lattice implication algebras is a topological mapping between their topological spaces. The Study of α-automated reasoning method based on the lattice-valued propositional logic LP In this part, the author given an a-automated reasoning method based on the lattice-valued propositional logic LP.

本文基于徐扬和秦克云的关于格蕴涵代数和以格蕴涵代数为真值域的格值命题逻辑系统LP的研究工作，对格蕴涵代数以及格值命题逻辑系统LP中基于α-归结原理的自动推理方法进行了系统深入的研究，主要有以下两方面的研究成果：一、关于格蕴涵代数的研究 1、对格蕴涵代数的格论性质进行了研究，得到了当L为完备格蕴涵代数时，关于∨，∧，→运算的一些结果； 2、对格蕴涵代数的左幂等元进行了研究，证明了格蕴涵代数L可以分解为任何一个左幂等元所对应的左映射的像集合与其对偶核的直和； 3、对格蕴涵代数的滤子的性质进行了研究，证明了滤子的结构相似于逻辑学中的Hypothetical syllogism规则和替换定理； 4、给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质个结构进行了研究，证明了格蕴涵代数的全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应的拓扑空间之间的拓扑映射。

与generalized Boolean algebra相关的网络解释 [注：此内容来源于网络，仅供参考]

generalized boolean algebra：广义布尔代数

generalized almost periodic function 广义殆周期函数 | generalized boolean algebra 广义布尔代数 | generalized continuum hypothesis 广义连续统假设