命题代数

词组短语

propositional algebra · algebra of propositions · algebra of proposition

与命题代数相关的网络例句 [注：此内容来源于网络，仅供参考]

Then, to decide whether a propositional formula can be deduced from a finite set of such formulas,we only need to decide whether the polynomial vanishes on an algebraic variety which is related to this formula set.

从而判定一个命题公式能否以一组命题公式推出，我们只需判定某一多项式是否在一代数簇上消失。

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).

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

This article takes the teaching of conic sections as an example. By designing worksheets, teachers can introduce the historical material about conic sections to students. By way of using Apollonius' definition of parabola, ellipse and hyperbola, teachers can introduce the geometric aspect of "conic section" to students. By using the concept of " latus rectum " in Conics , we can connect "conic sections"-- representation of geometrical aspect, with "the equation of conic sections"-- representation of algebraic aspect to improving insufficiency of text books.

同时本文也试著从历史文本中寻找材料，简单举例说明数学教师可以如何应用这些史料在几何单元教学上，例如三角函数的正余弦定理，最后再以圆锥曲线的正焦弦为例，说明如何利用数学史料於此单元的教学，尤其是阿波罗尼斯的《锥线论》中对圆锥曲线的3个命题，将此3个命题的内容与意涵，尤其是正焦弦在圆锥曲线的几何意义上所扮演的角色，将其适当地融入教学中，将可使学生真正学习圆锥曲线的几何知识，而不再只是代数形式的几何知识。

The study of lattice-valued propositional logic system based on lattice implication algebra.On the bases of previous study, by using the concepts and methods of T algebras we established the lattice-valued propositional logic system LP , whose truth values domain is a lattice implication algebra, and discussed systematically the semantical and syntactical properties of LP , proved the soundness theorem 、consistency theorem、deduction theorem and the decidability of validity of the system when the truth values lattice is finite. We also discussed the relationship between the α-theorem of some premise, say A, and the closed sets that contain A.

本文在前人研究工作的基础上，利用T代数的概念与方法，建立了真值取于格蕴涵代数的格值命题逻辑系统LP，对它的语义及语法性质进行了较系统的研究，得到了它的可靠性定理、协调性定理及演绎定理等，证明了值格有限时系统"有效性"的可判定性并讨论了某一前提A下的α定理与包含A的闭集之间的关系。

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

We study the properties of $BR_0$-algebra and the total complication triple I method on complete $BR_0$-algebra, and we apply the results to $R_0$-Unite interval $\overline{W}$. Not only we have simplified the proof of the results of $R_0$-type triple I method on $R_0$-Unite interval $\overline{W}$, but also we make the proof to combine with the formal deductive system for fuzzy propositional calculus. This work also explains that the $R_0$-type triple I method is a matching fuzzy inference with $B{\cal L}^*$ system.

研究了基础$BR_0$-代数的性质和基于完备基础$BR_0$-代数的全蕴涵三I算法，对一般蕴涵算子给出了三I算法解存在的一个充分条件，并将结果应用于$R_0$-单位区间$\overline{W}$，不但极大的简化了$R_0$-单位区间$\overline{W}$的$R_0$-型$\alpha$-三I算法结果的证明，而且使其证明过程与相应的模糊命题演算系统结合起来，说明了$R_0$-型三I算法是与$B{\cal L}^*$系统相匹配的模糊推理方法。

Finally,a simplified case of BOFL,i.e.Boolean Operator Propositional Logicestablished on a Boolean algebra,is further discussed.A complete algorithmfor finding the true level and false level of a formula in BOPL,which subsumes the re-lated work by Wang H.in the propositional logic,is also provided.

对布尔算子模糊逻辑的简化情形一布尔算子命题逻辑作了进一步讨论，放宽了对真值域的要求，将布尔算子命题逻辑建立在布尔代数上，并推广了命题逻辑中的王浩算法，给出了一个完备的求给定公式恒真水平和恒假水平的机械推导算法。

The formal deductive systenm for Fuzzy propositional calculus, R0-algebras and BR0-algebras have been studied. The concepts of WBR0-algebras are proposed, the relationship between it and BR0-algebras has been investigated, the definition of basis BR0-algebras is simplified. Based on discussing the relationship between regular FI-algebras and regular residual lattice, the relationship between FI-algebras and basis R0-algebras has been investigated.

研究了王国俊教授建立的模糊命题演算的形式演绎系统L和与之在语义上相匹配的R0-代数以及吴洪博教授提出的基础R0-代数和基础L系统，提出了WBR0-代数的观点，讨论了它与BR0-代数的关系，简化了BR0-代数的定义，在讨论正则FI-代数与正则剩余格之间关系的基础上，讨论了BR0-代数与FI-代数的相互关系。

Based on the production of other researchers such as professor Xu Yang and professor Qin Keyun, this paper discusses the structure and properties of lattice implication algebra, tautologies in some lattice-valued systems, automated reasoning methods, lattice-valued propositional logic system.

本文的工作是在徐扬教授、秦克云教授等研究成果的基础上，对格蕴涵代数的性质、结构、格值命题逻辑系统中的重言式、自动推理方法、格值命题逻辑系统等进行了一些研究。

与命题代数相关的网络解释 [注：此内容来源于网络，仅供参考]

number system：数系

代数方面强调数系(number system)概念,用较严密的逻辑方法以证明数学上的定理. 前人依赖欧几里德几何来训练逻辑思维,在新数学课程里,主要是削减欧氏几何的非基本命题或非基本而繁复的命题而致力于更有趣的项目. 课程中加入集合论的概念逻辑,

propositional algebra：命题代数

proposition 命题 | propositional algebra 命题代数 | propositional calculus 命题演算