propositional variable

propositional variable的基本解释

-

命题变量

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

A renaming is a function mapping propositional variable to itself or its complement, a variable renaming is a permutation over the set of propositional variables of a formula, and a literal renaming is a combination of a renaming and a variable renaming.

许道云 ，董改芳，王健改名是一个将变元映射到变元本身或它的补的函数，变元改名是公式变元集合上的一个置换，文字改名是一个改名和一个变元改名的组合。

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

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

propositional variable：命题变元

propositional logic 命题逻辑 | propositional variable 命题变元 | protractor 量角器分度规

propositional variable：命题变量

propositional function 命题函数 | propositional variable 命题变量 | proprietary account 业主帐户

propositional variable, sentential variable：命题变元

命题|proposition | 命题变元|propositional variable, sentential variable | 模表示|modular representation