propositional [prɔpə'ziʃənəl]

propositional的基本解释

adj.

建议的, 提议的

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

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

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规则

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

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

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

propositional algebra：命题代数

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

propositional calculus：命题演算

关系演算基于数理逻辑的一个分支命题演算(propositional calculus),更精确地说是一阶谓词演算(first-order predicate calculus). 关系演算在逻辑表达式中使用AND和OR这样的运算符来进行关系运算. SEQUEL(结构化英语查询语言)是SQL的前身,由IBM开发,

propositional calculus：命题演算(又称"命题 辑

propositional axiom 命题公 | propositional calculus 命题演算(又称"命题 辑") | propositional connective 命题 结词

propositional calculus：命題統計

dicisign 命題記號 | propositional calculus 命題統計 | propositional attitude 命題態度

propositional calculus：命题演算Btu中国学习动力网

proposition 命题Btu中国学习动力网 | propositional calculus 命题演算Btu中国学习动力网 | propositional inference 命题推演Btu中国学习动力网