BIK+-逻辑与非可换模糊逻辑

引入BIK -逻辑的概念,证明了BIK -逻辑的可靠性定理(基于BCC-代数)。同时,研究了BIK -逻辑与非可换模糊逻辑的关系,说明了各种源于模糊逻辑的代数结构之间的内在联系,并用一个图示表达了这些关系。     

基于格值逻辑的模糊概念格

从逻辑的角度,将非经典逻辑之一的格值逻辑引入概念格,建立了格值模糊形式背景,通过格结构来刻画对象与属性之间的模糊关系,证明了由蕴涵算子诱导的算子对是伽罗瓦连接,并讨论了相关的一些性质,进而给出了格值模糊概念格的构造算法.格值模糊概念格的建立为模糊性与不可比较性信息的处理提供了可靠的数学工具.     

模糊蕴涵格理论

模糊蕴涵代数,在文献中简称为FI代数,最初由吴望名先生于1990年提出,至今已经有许多研究成果.文中综述有关FI代数的概念,性质等主要研究工作,同时给出这类代数的一些新的性质.重点强调构成格结构的FI代数,称之为模糊蕴涵格,简称为FI格.这类代数结构与模糊逻辑中几个重要的代数系统具有紧密的联系,文中将揭示这些联系,一些重要的模糊逻辑代数系统都是FI格类的子类.另外,所有正则FI格构成代数簇,即等式代数类.这个代数簇将在模糊逻辑与近似推理中发挥重要的作用.     

R_O-蕴涵算子所导出的逻辑函数的特征

R_0-蕴涵算子是王国俊在2000年建立的一种新型蕴涵算子.目前,R_0-蕴涵算子在模糊控制、近似推理、模糊识别、模糊系统、计量逻辑的研究方面有着重要应用,而这些应用的共同点,是公式通过R_0-蕴涵算子所导出的逻辑函数在其中发挥着关键的作用.本文在R_0-型命题逻辑系统中,对由n个原子公式生成的公式通过R_0-蕴涵算子导出的逻辑函数的特征进行了研究,得到了函数可由R_0-型命题逻辑系统中的公式通过R_0-蕴涵算子导出的充要条件.     

模糊逻辑代数的Loomis—Sikorski表现定理

通过研究MV-代数、Π-代数、G-代数、R0-代数等模糊逻辑代数的赋值(从模糊逻辑代数L到单位区间[0,1]的同态)与滤子之间的关系,建立了MV-代数、Π-代数、G-代数、R0-代数等模糊逻辑代数的Loomis-Sikorski表现定理.     

格蕴涵代数的蕴涵表示定理

在对格蕴涵代数和模糊蕴涵代数研究的基础上,给出了格蕴涵代数的三个蕴涵表示定理。极大地简化了格蕴涵代数的定义形式,使得格蕴涵代数在形式上更加突出逻辑代数的特征及其与其它逻辑代数之间的联系与区别。为进一步研究格蕴涵代数及其与其它逻辑代数的关系提供了一个有力的工具。     

Kleene逻辑函数—一类广义模糊逻辑函数

引进了一类广义模糊逻辑函数－Ｋｌｅｅｎｅ逻辑函数，讨论了这类函数的基本性质，并在这个函数类与正则三值逻辑函数之间建立起同构关系。     

格蕴涵代数的区间值模糊子代数

将区间值模糊集的概念应用于格蕴涵代数,引入区间值模糊格蕴涵子代数的概念并研究它们的性质.讨论了区间值模糊格蕴涵子代数与（模糊）格蕴涵子代数之间的关系;定义了区间值模糊集的象和原象,获得了区间值模糊格蕴涵子代数的象和原象成为区间值模糊格蕴涵子代数的条件.     

R0-代数的格蕴涵表示定理

通过对模糊命题演算系统∧*及相应的Lindenbaum代数的研究,给出了R0-代数的格蕴涵表示形式,极大地简化了R0-代数的定义形式,使得R0-代数从定义形式上更加符合逻辑代数的特征,突出了R0-代数和其它逻辑代数的区别与联系,为进一步研究R0-代数及其和其它逻辑代数的关系提供了一个强有力的工具。     

BCK-代数的(∈,∈) ((∈,∈∨ q),(∈-,(∈- ∨(q-))-模糊蕴涵理想

应用模糊点和模糊集间的关系,给出BCK-代数(∈,∈)((∈,∈∨q),(∈-),(∈- ∨(q-))-模糊蕴涵理想的定义,描述了BCK-代数的(∈,∈)-模糊蕴涵理想与模糊理想,模糊子代数间的关系,研究了BCK-代数的模糊子集为(∈,∈)((∈,∈∨q),((∈-,(∈- ∨(q-))-模糊蕴涵理想的充要条件.     

Continuity, proof systems and the theory of transfinite computations

 We use the theory of domains with totality to construct some logics generalizing ω-logic and β-logic and we prove a completenes theorem for these logics. The key application is E-logic, the logic related to the functional ³ E. We prove a compactness theorem for sets of sentences semicomputable in ³ E. Received: 21 January 1998 / Published online: 2 September 2002     

An Extension Principle for Fuzzy Logics

Let S be a set, P(S) the class of all subsets of S and F(S) the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P(S) into a fuzzy closure operator J* defined in F(S). This enables us to give the notion of canonical extension of a deduction system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. Mathematics Subject Classification : 03B52.     

Fuzzy events and fuzzy logics in classical information systems

Classical information systems are introduced in the framework of measure and integration theory. The measurable characteristic functions are identified with the exact events while the fuzzy events are the real measurable functions whose range is contained in the unit interval. Two orthogonality relations are introduced on fuzzy events, the first linked to the fuzzy logic and the second to the fuzzy structure of partial a Baer¹-ring. The fuzzy logic is then compared with the “empirical” fuzzy logic induced by the classical information system. In this context, quantum logics could be considered as those empirical fuzzy logics in which it is not possible to have preparation procedures which provide physical systems whose “microstate” is always exactly defined.     

Fuzzy Modal Logics

In the paper we introduce formal calculi which are a generalization of propositional modal logics. These calculi are called fuzzy modal logics. We introduce the concept of a fuzzy Kripke model and consider a semantics of these calculi in the class of fuzzy Kripke models. The main result of the paper is the completeness theorem of a minimal fuzzy modal logic in the class of fuzzy Kripke models.__________Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 9, No. 1, pp. 201–230, 2003.     

粗糙模糊集与模糊粗糙集的截集性质

研究粗糙模糊集、模糊粗糙集、广义粗糙模糊集和广义模糊粗糙集的截集性质,并且还研究了基于逻辑算子的广义模糊粗糙集的基本性质。     

A normal form which preserves tautologies and contradictions in a class of fuzzy logics

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based on refutation methods.De Morgan implicative systems are triples like the De Morgan systems, which consider fuzzy implications instead of t-conorms. These systems can be used to evaluate the formulas of a propositional language based on the logical connectives of negation, conjunction and implication. Therefore, they determine different fuzzy logics, called implicative De Morgan fuzzy logics.In this paper, we will introduce a normal form for implicative De Morgan systems and we will show that for implicative De Morgan fuzzy logics whose t-norms are strict, this normal form preserves contradictions as well as tautologies.     

Fuzzy propositional logics

Fuzzy logic $\text{L}$_∞9 considered in connection with fuzzy sets theory, is a special theory, is a special many valued logic with truth-value sets [0, 1], which has been studied already by Lukasiewicz. We consider also his versions $\text{L}$_m for m ? 2 with finite truth-value sets. In all cases we add two further propositional connectives, one conjunction and one disjunction. For these logics we give a list of tautologies, consider relations between their sets of tautologies, prove their compactness, and mention some further results.     

Fuzzy sets: A topos-logical point of view

Bénabou deduction-categories are defined, with a set of additional assumptions that define categories with formal finite limits (resp. formal regular categories, formal logoi, formal topoi). They are shown to be generalized structures in which higher-order many-sorted languages can be realized. The corresponding Gentzen-type higher-order calculus of sequents is explicited and the soundness theorem is formulated. A construction is given, which associates to each deduction category with formal properties a real category with the corresponding real properties, in a universal way. The corresponding sounddess and completeness properties are formulated for the real categories thus obtained. Fuzzy sets, as generalized by Goguen are introduced, considered as the objects of a category Fuz(H), which turns out to be the real category associated to a very simple formal topos, and thus to be itself a topos: furthermore this is proved to be a Grothendieck topos which is a strictly full epireflective subcategory of Higgs' category of ‘H-valued sets’. Topoi are proposed as generalized fuzzy sets, and deductio0-categories as generalized² fuzzy sets. Some related topics such as Arbib-Manes fuzzy theories, probability, many-valued and fuzzy logics, intensional logic are very briefly touched upon.