基于有限格蕴涵代数的格值命题逻辑语法系统

以有限格蕴涵代数为真值域，建立了基于有限格蕴涵代数的格值命题逻辑系统；采用公理化的方法，给出了该系统在A水平上的语法导出、证明和协调性等基本定义，并证明了系统的可靠性定理、协调性定理、弱完备性定理和弱演绎定理．     

格蕴涵代数

本文将格与蕴涵代数结合在一起,建立了格蕴涵代数,并讨论了它的一些基本性质, 为从语义的角度研究格值逻辑系统奠定了必要的基础.      

Lattice-valued modal propositional logic based on M-lattice implication algebras

The modal lattice implication algebra (i. e., M-lattice implication algebra) is introduced and its properties are investigated. The modal lattice-valued propositional logical system is introduced by considering the M-lattice implication algebra as the valuation field, and the syntax and semantic of the logical system are discussed, respectively.     

J-Resolution Fields of Generalized Literals of L14 P（X）

Introduction In order to study the lattice-valued logic system,Xu[1]proposed the concept of lattice implication alge-bra by combining the lattice with the implication alge-bra and discussed its properties systematically. InRefs.[2,3], a lattice-valued propositional logic sys-tem was established using the concepts of free alge-bra, which corresponds to the lattice implication alge-bra, and the semantic and syntactical problems of thissystem were discussed. Xu et al[4]extended the reso-lution p…     

基于有限格蕴涵代数的格值命题逻辑语义系统

以有限格蕴涵代数作为逻辑系统的真值域，在其上建立了基于有限格蕴涵代数的格值命题逻辑语义系统，研究了在A水平上系统的赋值和公式的可满足性等基本定义，证明了系统“有效性”的可判定性并给出了判定算法。     

格蕴涵代数的模型论性质

讨论有关格蕴函代数结构的模型论性质,证明了形式化格蕴函数代数理论Ｔ保子模型,保模型链之并、保模型同态、理论Ｔ不是完备的,也不是模型完备的,因此不存在内在Ｓｋｏｌｅｍ函数。另外,文中借助于超滤概念提出了格蕴函代数簇的超积及格蕴函代数中模糊子集的模糊超积,并进而研究了模糊滤子、模糊关联滤子及模糊子格蕴涵代数的相应性质。     

一阶逻辑中的扩展子句消去原则

对于一阶逻辑定理证明器，子句集化简一直是必不可少的步骤，这将有助于提高后续一阶逻辑定理证明器的证明效率. 针对子句冗余性的判断，提出了一种评估子句冗余性的原则:集合蕴涵模归结原则. 并且证明了该原则在不带等词一阶逻辑上的可靠性，根据该原则删除子句，不会影响原始子句集的不可满足性或者可满足性. 此外，依据该原则提出了两种新型的一阶逻辑预处理方法:集合归结包含消去（set resolution subsumption, SRSE）方法和集合归结不对称恒真消去（set resolution asymmetric tautology elimination, SRATE）方法，并证明了这两种子句消去方法在不带等词一阶逻辑子句集上的可靠性. 最后在理论上比较了SRSE方法和归结包含消去（sesolution subsumption elimination, RSE）方法以及SRATE方法和归结不对称恒真（sesolution asymmetric tautology elimination, RATE）方法之间的有效性，结果表明SRSE方法和SRATE方法分别比RSE方法和RATE方法更为有效.      

Logical Properties of Lattice Filter of Lattice Implication Algebra

Introduction The concept of lattice was first introduced andelaborated by Dedekind, and the abstract structure oflattice was proposed by Birkhoff in 1935[1]. Sincethen, the lattice theory has gradually developed to be acomplete theoretical system[2], and extensively studiedby researchers[3-6]. In 1990s, Xu[7]proposed the con-cept of lattice implication algebras and investigatedsome of their properties. Then, Xu and Qin[8]intro-duced the notion of filters in lattice implication algebraand dis…     

格值上下文无关文法对基于词的计算

给出了当格半群满足交换律时,任何格值上下文无关文法都与格值Greibach范式文法等价,并利用Zadeh扩张原理,研究了格值Greibach范式文法对基于词的计算,最后得出文法对基于词的计算最终由对基于值的计算来实现。     

有余格

本文较详细地讨论了有余格及其一些性质,为进一步深入研究格值逻辑和L一Fuzzy拓扑学创 造了一些有利条件。      

粗糙集代数与格蕴涵代数

讨论粗糙集代数与格蕴涵代数的关系以及由粗糙集代数构造格蕴涵代数的方法．借助近似代数上的原子及同余关系，证明了在适当选取蕴涵算子及余运算之后，粗糙集代数就成为格蕴涵代数。     

格蕴涵代数的拓扑结构

给出了格蕴涵代数中弱滤子的概念，对弱滤子的性质和结构进行了研究，证明了格蕴涵代数中全体弱滤子构成一个拓扑结构，格蕴涵代数之间的蕴涵同构是相应拓扑结构之间的拓扑映射。     

关于格蕴涵代数模糊滤子的一个注记

在格蕴涵代数基本结构基础上进一步研究了格蕴涵代数的模糊滤子的性质，指出了模糊滤子可以诱导出格蕴涵代数的一簇同余关系，并研究了这簇同余关系的代数结构及灾些同余关系所诱导的商代数之间的同态映射。     

格值时态命题逻辑LTP(X)的语义问题

在格值命题逻辑系统LP(X)中引入时态算子E(曾经)和F(将会)以及它们的对偶算子H(曾经总是)和G(将会总是)，建立了一个以时轴为语境的格值时态命题逻辑系统LTP(X)，讨论了LTP(X)与时间相关的一系列性质及时态词的重叠问题，证明了MP语义规则和HS语义规则在该系统中成立。     

L-Fuzzy Rough Set Based on Complete Residuated Lattice

Residuated lattice is an important non-classical logic algebra, and L-fuzzy rough set based on residuated lattice can describe the information with incompleteness, fuzziness and uncomparativity in information systems. In this paper, the representation theorems of L-fuzzy rough sets based on residuated lattice are given. The properties and axiomatic definition of the lower and upper approximation operators in L-fuzzy rough sets are discussed.     

格蕴涵代数中的格蕴涵代数方程

根据逻辑代数方程理论,提出了格蕴涵代数方程的概念.讨论了格蕴涵代数L中的几种基本类型的一元格蕴涵代数方程,给出了方程的可解性判别条件.在此基础之上,证明了方程的解集构成L的凸子格.     

α-Automated Reasoning Method Based on Lattice-Valued Propositional Logic LP(X)

This paper is focused on automated reasoning based on classical propositional logic and lattice-valued propositional logic LP(X).A new method of automated resasoning is given ,and the soundness and completeness theorems of this method are proved.     

L-不分明化环

运用应明生教授提出的完全剩余格L值逻辑语义的方法引入了L—不分明化环的概念,然后讨论了L—环的若干性质.     

Subalgebra and LI-Ideal of Lattice Implication Algebras

First,We reviewed the definitions of lattice implication algebras,lattice implication subalgebras,and LI-ideals,and provided an equivalent definition of LI-ideal.Then we investigated some properties of lattice implication subalgebra and LI-ideal,and found the least lattice implication subalgebra.Finally,the relation between lattice implication subalgebra and LI-ideal is presented.It is proved that no LI-ideals are non-trivial lattice implication subalgebras.     

格值命题逻辑系统Lvpl中的推理规则

为描述取小、多重推理、多维推理等实际推理方法，在格值命题逻辑系统Lvpl中，引入了几类相应的推理规则．这些推理规则由语法和语义两部分组成，且在两部分之间存在一定的协调水平．证明了对于适当的语法语义协调水平，当Lvpl的公式集的L型模糊集为同态映射时，它们关于这几类推理规则都在一定程度上封闭.