G(o)del逻辑系统中模糊逻辑方程τ(X→p)=α的解的性质

以模糊逻辑系统中公式的真度概念为基础,提出了基于真度理论的模糊逻辑方程的概念.并在G(o)del逻辑系统中就形如τ(X→p)=α的模糊逻辑方程展开了讨论.我们得到了如下结论:模糊逻辑方程τ(X→p)=α有m-同型解当且仅当α∈{i/(m+2)!+1/2|i=0,1,2…,(m+2!/2)}.     

命题模糊逻辑系统Π和G(o)d中理论的相容度与下真度的计算公式(II)

讨论命题模糊逻辑系统Π和G(o)d中理论相容度与下真度的计算问题.引入逻辑公式的核、零核及理论的核的新概念,得到命题模糊逻辑系统Π和G(o)d中理论相容度与下真度的计算公式,给出理论不相容的新的充要条件.     

论G(O)del蕴涵算子不宜用于建立模糊逻辑系统

通过演绎定理和命题的真度理论指出基于G(O)del蕴涵算子的3值逻辑系统反映了直觉主义逻辑的特点.但如果基于G(O)del蕴涵算子建立模糊逻辑系统,则相应的语构理论与积分语义理论是不协调的.     

逻辑系统MTL（BL）的新的模式扩张系统GNMTL（GNBL）

首先给出了G(o)del非算子的一个重要性质:一个模糊逻辑系统中的非是G(o)del非的充要条件是如果x*y=0,则xy=0.然后,基于G(o)del非算子分别提出了逻辑系统MTL和BL的新的模式扩张系统GNMTL和GNBL.GNMTL(GNBL)是基于一类左连续t-模(连续t-模)(都包含乘积t-模及G(o)del t-模)的模糊逻辑的共同形式化;最后,分别给出了著名逻辑系统G(o)d与Ⅱ分剐作为GNMTL和GNBL 的模式扩张形式,同时给出了G(o)del逻辑系统的几种等价形式.     

n值G(o)del命题逻辑系统中的F度累积理论

在n值G(o)del命题逻辑系统中指出概率逻辑学基本定理成立,并提出了与真度相对应的F度,证明了F度累积定理.并比较了概率逻辑学基本定理与F度累积定理的异同.     

修正的G(o)del逻辑系统中三类无限子代数及其F(S)的分划

将修正的G(o)del逻辑系统中的广义重言式理论进行推广,讨论了逻辑系统G-中三类无限子代数上的广义重言式理论,并利用可达广义重言式的概念在G-的三类子代数中分另q给出F(S)关于→同余的一个分划.     

Gödel系统中由一个或两个原子生成的公式的真值函数的特征

在G(o)del系统中研究了仅由一个或两个原子生成的逻辑公式的真值函数的特征,进而按照逻辑等价关系对F(p),F(p,q)进行了细致的分类.     

G(o)del系统中由一个或两个原子生成的公式的真值函数的特征

在G(o)del系统中研究了仅由一个或两个原子生成的逻辑公式的真值函数的特征,进而按照逻辑等价关系对F(p),F(p,q)进行了细致的分类.     

Gdel逻辑系统中模糊逻辑方程τ(X→p)=α的解的性质

以模糊逻辑系统中公式的真度概念为基础,提出了基于真度理论的模糊逻辑方程的概念。并在Go¨del逻辑系统中就形如τ(X→p)=α的模糊逻辑方程展开了讨论。我们得到了如下结论:模糊逻辑方程τ(X→p)=α有m-同型解当且仅当α∈{i/(m+2)!+1/2i=0,1,2…,(m+2)!/2}。     

论Gdel蕴涵算子不宜用于建立模糊逻辑系统

通过演绎定理和命题的真度理论指出基于Go¨del蕴涵算子的3值逻辑系统反映了直觉主义逻辑的特点。但如果基于Go¨del蕴涵算子建立模糊逻辑系统,则相应的语构理论与积分语义理论是不协调的。     

模糊逻辑系统中广义有效推理的真度递减定理

在模糊逻辑系统中提出了广义有效推理;根据积分真度的性质,证明了广义有效推理的积分真度递减定理,从而在模糊逻辑系统中实现了根据推理前提的真度计算推理结论的真度;最后,把真度递减定理与利用斐波那契数列对推理结论真度的推算结果进行了对比,说明了真度递减定理的优越性.     

一阶模糊谓词逻辑公式的解释模型真度理论及其应用

基于一阶模糊谓词逻辑公式的有限和可数解释真度的理论,引入了一阶模糊谓词逻辑公式的解释模型及解释模型真度的概念,并讨论了它们的一系列性质及其在近似推理中的应用.     

Fuzzy inequational logic

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pavelka approach and define general degrees of semantic entailment and provability using complete residuated lattices as structures of truth degrees. We prove the logic is Pavelka-style complete. Furthermore, we present a logic for reasoning about graded if–then rules which is obtained as particular case of the general result.     

Fuzzy constructive logic

We introduce a logical system in which the principles of fuzzy logic are interpreted from the point of view of the constructive approach The language of predicate formulas without functional symbols and symbols of constants is considered. The notion of identically trae predicate formula in the framework of the introduced logic is defined; two variants of this definition are given. Theorems concerning identically true predicate formulas are proved. Some connections between the introduced logic and the constructive (intuitionistic) predicate calculus are established. Bibliography: 40 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 358, 2008, pp. 130–152.     

Fuzzy equational logic

Presented is a completeness theorem for fuzzy equational logic with truth values in a complete residuated lattice: Given a fuzzy set Σ of identities and an identity p≈q, the degree to which p≈q syntactically follows (is provable) from Σ equals the degree to which p≈q semantically follows from Σ. Pavelka style generalization of well-known Birkhoff's theorem is therefore established. Received: 15 March 2000 / Revised version: 20 September 2000 Published online: 12 December 2001     

n值命题逻辑系统中公式真度的进一步研究

首先计算了四个 n 值命题逻辑系统L*,Luk,G(o)d及Ⅱ中一个典型公式户p1→p2真度;然后比较了公式p1→p2在这四个逻辑系统中真度的大小并分析了真度差异的原因;最后,研究了每个逻辑系统中公式p1→p2的真度随 n 变化的情况.     

标准序列逻辑系统S_3中公式的概率真度理论

利用势为3的非均匀概率空间的无穷乘积在三值标准序列逻辑系统中引入了公式的概率真度概念,证明了全体公式的概率真度值之集在[0,1]中没有孤立点;利用概率真度定义了概率相似度和伪距离,进而建立了概率逻辑度量空间,证明了该空间中没有孤立点,为三值命题的近似推理理论提供了一种可能的框架.     

Fuzzy logic in measurements

Our main interest in this paper is to translate from “natural language” into “system theoretical language”. This is of course important since a statement in system theory can be analyzed mathematically or computationally. We assume that, in order to obtain a good translation, “system theoretical language” should have great power of expression. Thus we first propose a new frame of system theory, which includes the concepts of “measurement” as well as “state equation”. And we show that a certain statement in usual conversation, i.e., fuzzy modus ponens with the word “very”, can be translated into a statement in the new frame of system theory. Though our result is merely one example of the translation from “natural language” into “system theoretical language”, we believe that our method is fairly general.     

Fuzzy Horn logic II

The paper studies closure properties of classes of fuzzy structures defined by fuzzy implicational theories, i.e. theories whose formulas are implications between fuzzy identities. We present generalizations of results from the bivalent case. Namely, we characterize model classes of general implicational theories, finitary implicational theories, and Horn theories by means of closedness under suitable algebraic constructions.