￡^＊系统的公理化扩张

通过对模糊逻辑命题演算形式系统￡^＊的代数语义——R0代数的研究，给出了R0代数簇的完整分类，并利用L^＊系统与幂零极小逻辑（NML）的等价性，由系统L^＊是可代数化逻辑出发，得到与R0代数真子簇对应的￡^＊系统的全部公理化扩张，文中所用的方法用样适用于其他满足逆序对舍关系的逻辑的扩张，具有较好的扩展性。     

L*系统的公理化扩张

通过对模糊逻辑命题演算形式系统L*的代数语义--R0 代数的研究,给出了R0代数簇的完整分类,并利用L*系统与幂零极小逻辑 (NML)的等价性,由系统L*是可代数化逻辑出发,得到与R0代数真子簇对应的L*系统的全部公理化扩张,文中所用的方法用样适用于其他满足逆序对合关系的逻辑的扩张, 具有较好的扩展性.     

Implicitly Maximal Classes and Implicit Completeness Criterion in the Three-Valued Logic

The problem of implicit expressibility in the three-valued logic is considered. The system of all implicitly maximal classes is described. The corresponding criterion of implicit completeness is formulated.     

基于形式概念的对象粒的属性逻辑公式描述

基于形式概念在属性集上建立逻辑语言系统,证明基于形式概念的基本对象粒描述定理,讨论合取原子属性逻辑公式所描述对象粒的性质,提出一个求解描述对象粒的属性逻辑公式的算法。     

数理逻辑中的数值化方法

数理逻辑的本质是形式推理而不是数值计算,非此即彼式的严谨性是其特征,因而在一定意义下它是"两极化"的.比如,(1)一个逻辑理论或者是相容的,或者是不相容的,不存在"半相容的"理论.(2)"逻辑公式A是假设集T的推论"或者成立,或者不成立,说它近似成立是无意义的.(3)逻辑公式中有重言式和矛盾式,但没有0.8重言式.本文的目的在于为上述基本概念提供程度化的版本,并从而建立一种近似推理理论.     

New sequent calculi for Visser's Formal Propositional Logic

Two cut‐free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic (FPL) are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei‐Ardeshir's calculi for Visser's Basic Propositional Logic.     

模糊Horn子句逻辑形式系统

简要回顾逻辑推理的发展历史,指出了经典数理逻辑中存在的一些问题。作者为每个传统的Horn子句赋予一个蕴涵强度f∈(0,1],从而得到模糊Horn子句及其Herbrand解释。进而,对传统Horn子句逻辑的语法和语义进行了拓展,建立了一个基于模糊Horn子句有限集合的逻辑推理系统,并证明了该系统的正确性和完备性。     

Theories of the Classical Propositional Logic and Substitutions

Mathematical Notes - For any propositional logic, Sushko’s lemma states that, for any substitution, the preimage of the set of all tautologies of this logic is its theory. The problem of the...     

基于形式概念的粗糙近似

证明了对象(属性)概念的外延(内涵)是构成概念外延(内涵)的基本单位,由此提供了通过外延(内涵)基本元来构造形式概念的方法.定义了几种基于外延基本元和内涵基本元的上、下近似,给出了近似算子的性质,并讨论了这些近似算子之间的相互关系.     

Lukasiewicz 命题逻辑系统一种新的理论的相容度

根据演绎定理和完备性定理,应用公式真度理论在Lukasiewicz命题模糊逻辑系统中讨论理论Γ的相容性,根据矛盾式■是Γ-结论的真度的大小,提出了一种新的极指标和相容度的概念.给出了理论Γ相容、不相容及其它相关结论的充分必要条件,并且获得了相容度与发散度之间联系的重要关系式.     

Superposition Decides the First-Order Logic Fragment Over Ground Theories

The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the hierarchic combination of a theory T with full first-order logic, FOL(T). If a FOL(T) clause set enjoys a sufficient completeness criterion, the calculus is even complete. Clause sets over the ground fragment of FOL(T) are not sufficiently complete, in general. In this paper we show that any clause set over the ground FOL(T) fragment can be transformed into a sufficiently complete one, and prove that SUP(T) terminates on the transformed clause set, hence constitutes a decision procedure provided the existential fragment of the theory T is decidable. Thanks to the hierarchic design of SUP(T), the decidability result can be extended beyond the ground case. We show SUP(T) is a decision procedure for the non-ground FOL fragment plus a theory T, if every non-constant function symbol from the underlying FOL signature ranges into the sort of the theory T, and every term of the theory sort is ground. Examples for T are in particular decidable fragments of arithmetic.     

基于中介逻辑的时序逻辑系统

本文基于中介逻辑建立了一种中介时序逻辑系统ＭＴＬ（Ｍｅｄｉｕｍ Ｔｅｍｐｏｒａｌ Ｌｏｇｉｃ），文中着重讨论了ＭＴＬ的形式系统并给出了它的语义解释，证明了ＭＴＬ系统的可靠性．最后对ＭＴＬ系统和经典时序命题逻辑系统进行对比，指出经典时序命题逻辑系统是ＭＴＬ的子系统     

Axiomatic definition of a quotient ring

The quotient ring QΦ(R) of the ring R with respect to a strong filter Φ of right ideals of R is axiomatically defined as a maximal strong Φ-essential extension of R. The ring QΦ(R) is constructively obtained in the form of lim Hom_r (I, R), where I ∈ Φ.     

基于集值映射的形式概念分析

Formal concept analysis (FCA) is a discipline that studied the hierarchical structares induced by a binary relation between a pair of sets,and applies in data analysis,information retrieval,knowledge discovery,etc.In this paper,it is shown that a formal context T is equivalent to a set-valued mapping S :G →P(M),and formal concepts could be defined in the set-valued mapping S.It is known that the topology and set-valued mapping are linked.Hence,the advantage of this paper is that the conclusion make us to construct formal concept lattice based on the topology.