参数Kleene系统中的广义重言式

引入新的一组带对数ｐ（ｐ∈「０,１」的ｔ－范∧ｐ,ｔ－余范∨ｐ和蕴涵θｐ,讨论它们的基本性质。在此基础上参数Ｋｌｅｅｎｅ系统Ｋｐ与三值Ｋｌｅｅｎｅ系统Ｋ３,三值Ｌｕｋａｓｉｅｗｉｃｚ系统Ｌ３和经典二值系统Ｂ２关于（广义）重言式的相互关系,指出系统Ｋｐ对广义重言式而言是可判定的。     

BCK—代数理想（Ⅳ）

本文是作者［１］－［６］的继续，我们得到下述结果：定理４．设Ｉ是ＢＣＫ－代数Ｘ的一个理想，ａ是Ｘ的一个元素，则包含Ｉ和ａ的最小理想是对某个非负整数｝．定理１４．设Ｘ是一个Ｌｕｋａｓｉｅｗｉｃｚ代数，Ｉ是Ｘ的一个质理想．如果Ａ是Ｘ的一个真理想且，则Ａ也是质的．定理１５．Ｌｕｋａｓｉｅｗｉｃｚ代数Ｘ的零理想｛０｝是质的当且仅当＜Ｘ；≤＞是一个全序集．     

系统RDP中的广义重言式理论

研究带参数的模糊逻辑系统RDP中的广义重言式理论.结果表明系统RDP中只有三种不同的广义重言式,即(1/2),重言式,(1/2)+-重言式和重言式.将一些多值逻辑系统和模糊逻辑系统中行之有效的升级算法运用于系统RDP,证明在该系统中,升级算法可以将可迭0-重言式和可达(1/2)-重言式分别提升为可这(1/2)-重言式和可达(1/2)+-重言式,但是,对可达(1/2)+-重言式升级算法的结果仍然得到可达(1/2)+-重言式.这表明对非重言式有限次利用升级算法未必能得到重言式.     

The Convergences of Bivariate Integral Jackson Interpolating Operators in Orlicz Spaces

ＴｈｅＣｏｎｖｅｒｇｅｎｃｅｓｏｆＢｉｖａｒｉａｔｅＩｎｔｅｇｒａｌＪａｃｋｓｏｎＩｎｔｅｒｐｏｌａｔｉｎｇＯｐｅｒａｔｏｒｓｉｎＯｒｌｉｃｚＳｐａｃｅｓ尚增科，王有一，盛保怀ＴｈｅＣｏｎｖｅｒｇｅｎｃｅｓｏｆＢｉｖａｒｉａｔｅＩｎｔｅｇｒａｌＪａｃ...     

修正的Product逻辑系统中的广义重言式理论

首先证明了在修正的Product逻辑系统中广义重言式有更加精细的区分；其次通过引入一类特殊的公式序列和特殊公式，进一步证明了对任意有理数a∈[0，1]，可达α-重言式集是类类非空的，并同时给出了修正的Product逻辑系统中广义重言式的升级算法。     

善做事后诸葛亮

在解 (证 )数学题的过程中 ,题目的条件有时难以“一眼望穿” .随着解题的深入和解题后的回顾反思 ,再对条件进行重新组配、挖掘 ,有利于我们选择最佳的逻辑通道、优化解法、现举例加以说明 .例 1　若ａ、ｂ、ｃ为互不相等的实数 ,且 ｘａ -ｂ=ｙｂ-ｃ=ｚｃ -ａ,求ｘ +ｙ +ｚ的值 .分析　由于 (ａ -ｂ) +(ｂ -ｃ) +(ｃ -ａ)≥ 0 ,故不能对条件用等比定理 ,可设 ｘａ -ｂ=ｙｂ-ｃ=ｚｃ-ａ=ｋ.则得ｘ=ｋ(ａ-ｂ) ,ｙ=ｋ(ｂ -ｃ) ,ｚ=ｋ(ｃ-ａ) .故ｘ +ｙ +ｚ=ｋ(ａ -ｂ) +ｋ(ｂ -ｃ) +ｋ(ｃ -ａ) =0 .反思　由ｘ+ｙ+ｚ=0这一结论信息知ｘ +ｙ =…     

扰动模糊命题逻辑系统中的广义重言式

通过定义二维R0-蕴涵算子，将王国俊教授在逻辑系统形中的广义重言式理论推广并应用到二维赋值的扰动模糊命题逻辑系统西中，证明了这一系统中（μ，δ）-重言式就是某个（λ，1-λ）-重言式，最终获得与一维线性赋值格上完全相应的广义重言式分类。     

J-半单亚直既约环类确定的上限

Ｆ．Ａ．Ｓｚａｓｚ在［１］中提出公开问题５５：设Ｋ是Ｊａｃｏｂｓｏｎ根为零的全体亚直既约环类,研究类Ｋ确定的上根．本文对此进行了研究,证明了Ｊａｃｏｂｓｏｎ根为零的全体亚直既约环类Ｋ确定的上根Ｒ是特殊根,它介于Ｊａｃｏｂｓｏｎ根与Ｂｒｏｗｎ－ＭｃＣｏｙ根之间．并给出任意结合环Ａ为Ｒ－根环的充要条件．     

二元Jackson插值多项式及其在Orlicz空间中的逼近阶

本文引进了Ｋａｎｔｏｒｏｖｉｔｃｈ算子型的二元修正Ｊａｃｋｓｏｎ三角插值多项式，给出了其在Ｏｒｌｉｃｚ空间中的收敛阶，作了推论，给出了二元修正Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值算子在带Ｏｒｌｉｃｚ空间中的逼近的量化估计。     

αK bH=c曲面的Bcklund变换

本文首先对Ｇａｕｓｓ曲率Ｋ和平均曲率Ｈ满足线性关系ａＫ＋ｂＨ＝ｃ的曲面，证明了其ＧａｕｓｓＷｅｉｎｇａｒｔｅｎ公式不仅可看作曲面的Ｇａｕｓｓ－Ｃｏｄａｚｚｉ方程的Ｌａｘ对，而且给出了Ｂ¨ａｃｋｌｕｎｄ变换．然后，将著名的关于负常曲率的Ｂ¨ａｃｋｌｕｎｄ定理推广到主曲率ｋ１和ｋ２满足关系（ｋ１－ｍ）（ｋ２－ｍ）＝－ｌ２的曲面     

多值逻辑的古典方法

本文给多值逻辑一个古典逻辑观察方法。通过引入断词，勾通了多值逻辑与古典逻辑的联系，使全部古典理论在多值逻辑中都有直接应用；规定一类多值公式与古典公式的对应，从而建立起一类多值公式的公理系统，得出一些结果。     

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.     

On many-valued logics,fuzzy sets,fuzzy logics and their applications

This paper gives a survey of some aspects of many-valued logics and the theory of fuzzy sets and fuzzy reasoning, as advocated in particular by Zadeh. It starts with a short discussion of the development of many-valued logics and its philosophical background. In particular, the systems of Lukasiewicz and their algebraic models are presented. In connection with the famous Arrow paradoxon, Boolean valued and fuzzy social orderings are discussed. After some remarks on inference, fuzzy sets are introduced and it is shown that their definition is sound if some acceptable rationality requirements are demanded. Deformable prototypes are suggested in order to obtain the numerical values of the membership function for some applications. Finally, a recent paper of Bellman and Zadeh on a fuzzy logic, where the truth values themselves are fuzzy, is reviewed.     

系统L_n中公式相对于有限理论的Г-绝对真度理论

将多值逻辑中的∑-α重言式理论与计量逻辑学中的真度理论相结合,在n值Lukasiewicz命题逻辑系统中引入了公式相对于有限理论Γ的Γ-绝对真度概念,讨论了它的若干性质.利用Γ-绝对真度定义了公式间的Γ-绝对相似度与伪距离,为进一步建立n值Lukasiewicz命题逻辑系统相对于有限理论Γ的近似推理奠定了基础.     

n值Lukasiewicz命题逻辑系统中公式的随机真度及近似推理

利用赋值集的随机化方法,在n值Lukasiewicz命题逻辑系统中引入公式的随机真度,证明了随机真度的MP规则、HS规则及交推理规则;同时引入公式间的随机相似度和随机伪距离,建立了随机逻辑度量空间,推导出随机相似度的若干性质,证明了随机逻辑度量空间中逻辑运算的连续性;并在随机逻辑度量空间中提出了三种不同类型的近似推理模式,证明了三种近似推理模式的等价性.     

Formal Axiomatic Theories Based on a Three-Valued Logic

Formal axiomatic theories based on the three-valued logic of Lukasiewicz are considered. Main notions related to these theories, in particular, those of Luk-model, Luk-consistent theory, and Luk-complete theory are introduced. Logical calculuses that describe such theories are defined; counterparts of the classical compactness and completeness theorems are proved. Theories of arithmetic based on Lukasiewicz’s logic and on its constructive (intuitionistic) variant are investigated; the theorem on effective Luk-incompleteness is proved for a large class of arithmetic systems. This theorem is a three-valued counterpart of the famous Godel theorem on incompleteness of formal theories. Three-valued counterparts of Presburger’s arithmetic system are defined and proved to be Luk-complete but incomplete in the classical sense. Bibliography: 29 titles.__________Published in Zapiski Nauchnykh Seminarov POMI, Vol. 304, 2002, pp. 19–74.     

Optimal strategic reasoning with McNaughton functions

The aim of the paper is to explore strategic reasoning in strategic games of two players with an uncountably infinite space of strategies the payoff of which is given by McNaughton functions—functions on the unit interval which are piecewise linear with integer coefficients. McNaughton functions are of a special interest for approximate reasoning as they correspond to formulas of infinitely valued Lukasiewicz logic. The paper is focused on existence and structure of Nash equilibria and algorithms for their computation. Although the existence of mixed strategy equilibria follows from a general theorem (Glicksberg, 1952) [5], nothing is known about their structure neither the theorem provides any method for computing them. The central problem of the article is to characterize the class of strategic games with McNaughton payoffs which have a finitely supported Nash equilibrium. We give a sufficient condition for finite equilibria and we propose an algorithm for recovering the corresponding equilibrium strategies. Our result easily generalizes to n-player strategic games which don't need to be strictly competitive with a payoff functions represented by piecewise linear functions with real coefficients. Our conjecture is that every game with McNaughton payoff allows for finitely supported equilibrium strategies, however we leave proving/disproving of this conjecture for future investigations.     

MV代数定义的蕴涵简化形式

通过对MV代数和Lukasiewicz命题演算系统的研究,我们对MV代数的定义进行了简化,并讨论了MV代数和其它代数之间的关系。主要结果是:(1)从蕴涵角度出发,给出了MV代数的两种简化定义;(2)提出了弱格蕴涵代数的概念,并证明了它与BR0代数等价;(3)证明了弱格蕴涵代数是正则Fuzzy蕴涵代数。     

The eal truth

We study a real valued propositional logic with unbounded positive and negative truth values that we call ‐valued logic. Such a logic is semantically equivalent to continuous propositional logic, with a different choice of connectives. After presenting the deduction machinery and the semantics of ‐valued logic, we prove a completeness theorem for finite theories. Then we define unital and Archimedean theories, in accordance with the theory of Riesz spaces. In the unital setting, we prove the equivalence of consistency and satisfiability and an approximated completeness theorem similar to the one that holds for continuous propositional logic. Eventually, among unital theories, we characterize Archimedean theories as those for which strong completeness holds. We also point out that ‐valued logic provides alternative calculi for ?ukasiewicz logic and for propositional continuous logic.     

扰动模糊命题逻辑的代数结构及其广义重言式性质

着眼于扰动模糊命题逻辑的代数结构,为研究二维扰动模糊命题逻辑最大子代数I2R及其广义重言式提供了一些代数理论基础,最后研究了子代数间广义重言式的关系.