逻辑代数

A new network routing algorithm is proposed, which follows calculation rues of logic algebra and calculates routes with depression of order transformation of incidence martrix. For network with m nodes, m-2 times depression of order transformation operations can get all routes between two nodes. Furthermore, it accords with the communication transmission rules and avoids the close loop routes.

提出一种网络路由新算法，是按照逻辑代数运算规则，以关联矩阵降阶变换方式计算，对于有m个节点的网络，只需m-2次距阵降阶变换运算，就能够算得网络两节点间全部路由，且不会出现闭环路由问题，完全符合通信传输规则。

Fuzzy logic is studied with algebraic tools in this paper. A kind of algebraic abstract of fuzzy logic, Implication Algebra on a partial ordered set, is given. The relations between Implication Algebra and other algebraic structures, such as MV-Algebra and Heyting Algebra etc., and the filter and the structure of Implication Algebra on a partial ordered set are studied.

本文的目的是使用代数工具对模糊逻辑进行研究，给出模糊逻辑的一类代数抽象，即偏序集上的蕴涵代数，研究偏序集上蕴涵代数与其它代数结构，如MV-代数，Heyting代数之间的关系，以及偏序集上蕴涵代数的滤子与其结构等。

Then we deeply studied the completeness of LP . Consequently, we established:(1) The completeness theorem of LP with truth-value in finite Lukasiewiczchain;(2) The completeness theorem of LP with truth-value in complete and atomic lattice implication algebras;(3) The completeness theorem of LP with truth-value in injective lattice implication algebras.

建立了：（1）基于Lukasiewicz有限链的格值命题逻辑系统LP的完备性定理；（2）基于完备的且原子的格蕴涵代数的格值命题逻辑系统LP的完备性定理；（3）基于内射的格蕴涵代数的格值命题逻辑系统LP的完备性定理。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

The algebraic and coalgebraic methods in computer science is investigated in general, including its basic ideas, the categorical properties of algebras and coalgebras, initial algebra and final coalgebra, bisimulation and behavior equivalence, coalgebraic specifications, and coalgebraic logics.

对代数方法与共代数方法的基本概念、代数与共代数范畴的性质、初始代数与终结共代数、双模拟与行为等价、共代数规范以及共代数逻辑进行了比较全面和深入的研究。

And using thinking of evolvable hardware design,it had realized a novel way in simplifying the given logic function,which was different from conventional method,such as algebra way and Karnaugh map way.Experiments showed that evolvable hardware method could solve simplification of large scale logic function.

作者在对演化硬件设计理论的学习研究中，尝试了用遗传算法在可编程逻辑器件上应用来实现对某一给定的逻辑函数进行化简。2代数法和卡诺图法介绍[1]先给定一个逻辑函数F，并对其进行化简：F=A+ABC+AC+CD(1)2.1代数法化简代数法化简就是运用代数的公理、定理和规则对逻辑函数进行化简。

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、给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质个结构进行了研究，证明了格蕴涵代数的全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应的拓扑空间之间的拓扑映射。

Hajek P Metamathematics of fuzzy logic London:Kluwer Academic Publishers , 1998,null

裴道武%王国俊一种新的模糊逻辑代数系统西南交通大学学报， 2000，05

About the experience of design ladder program design is the application of programmable logic controller of the most critical issues, PLC ladder programming methods commonly used are: experience design, design of sequential control and logic design, such as algebra.

经验设计法简介梯形图程序设计是可编程控制器应用中最关键的问题，PLC 梯形图程序设计常用方法有：经验设计法、顺序控制设计法和逻辑代数设计法等。

They are to monadic predicate logic what Boolean algebras are to propositional logic, and what polyadic algebras are to first-order logic.

它们对应一元谓词逻辑，而布尔代数对应于命题逻辑，而多元代数对应于一阶逻辑。

I didn't watch TV last night, because it .

昨晚我没有看电视，因为电视机坏了。

Since this year, in a lot of villages of Beijing, TV of elevator liquid crystal was removed.

今年以来，在北京的很多小区里，电梯液晶电视被撤了下来。