查询词典 propositional

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 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的闭集之间的关系。

But the content of a situated thought cannot be fully captured as propositional content: the content as delivered by the situatedness of the thinker essentially extends beyond anything that the mere propositional construal of the content can deliver.27 Because of this, although the over-all form of a transcendental argument might seem to be of a deductively valid argument e.g.

但是a situated thought的内容不能被完全把握为命题内容：内容作为被思者的situatedness给出，本质上超出了对纯粹的命题解释所能给出的内容。

Using the infinite product of unevenly distributed probability space with potential of 3, the concept of formula truth degree was introduced into the Gdel 3-valued propositional logic system. Moreover, it was proved that in the 3-value (1/4, 1/2, 1/4), measure the set of truth of degree of propositions was dense in [0, 1], and a general expression of truth degree was obtained, providing a basis for further developing approximate reasoning of 3-valued propositional logic system.

利用势为3的非均匀概率空间的无穷乘积，在Gdel三值命题逻辑系统中引入公式的真度概念，在三值逻辑(四分之一，二分之一，四分之一)测度下证明G3中全体公式的真度值之集在[0， 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、给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质个结构进行了研究，证明了格蕴涵代数的全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应的拓扑空间之间的拓扑映射。

In chapter 2, to meet the application requirements of incomplete information system, based on propositional connectives ∧、∨、→、ヲ、～ and ～, we construct medium logic propositional calculus system MP〓 and medium logic predicate calculus system MF〓.

第一章：简要说明不完全信息数据库和模糊数据库研究的目的和意义，介绍中介逻辑和模糊数据库的发展、模糊数据库系统的特性以及本文的主要研究工作。

Prenex normal form of the first order logic propositional is the key to propositional logic. Generally, there are three steps to change get a prenex normal form: first of all get rid of the connection word; Secondly, make the negative word to the front of every atomic.

对于一阶谓词化为其前束范式问题，一般可以通过三个步骤完成，首先去掉逻辑式中的连接词；其次将否定词深入到各原子公式中；最后利用永真等价式将量词逐个移到式子的前部。

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.

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

This paper proves that it is impossible for all the theorems in classical propositional calculus to be tautologies in the field of fuzzy propositional calculus, then a quasi formal deductive system is established for fuzzy propositional calculus based on a kind of type algebra.

引入了一种代数，称为模糊公式代数。在这种代数上建立了一个准形式演绎系统，证明了相应的可靠性定理与相容性定理，提出了程度化的ModusPonens规则和HypotheticalSylogism规则

As most of the present decision methods of propositional formulas are based on semantics and cannot give an important reference in many reasoning applications, namely deduction procedure, a deduction-based decision method that can give the deduction procedure during the decision procedure is presented based on the propositional calculus system L.

目前命题公式的判定方法大都是基于语义的，不能给出演绎过程，而演绎过程是许多推理性应用的重要依据。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。