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

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

直觉模糊命题逻辑的广义拟重言式及其分类

通过定义一个蕴涵算子,建立一个直觉模糊命题逻辑系统(I20, ,V,→T),讨论了系统I20上的广义拟重言式的分类,将王国俊教授的广义重言式理论从一维推广到二维的直觉模糊命题逻辑上.     

区间值模糊命题逻辑的最大子代数及其广义重言式

将S-型蕴涵算子改为R0-蕴涵算子，从而找到区间值模糊逻辑I[0，1]的一个最大子代数IQ，进而将王国俊教授在逻辑系统W中的广义重言式理论推广应用到IQ中。     

R0-代数的扰动模糊子代数和扰动模糊MP滤子

把扰动模糊集理论应用在R_0-代数上,给出R_0-代数的扰动模糊子代数,扰动模糊MP滤子的概念,讨论R_0-代数上扰动模糊子代数的等价刻画和扰动模糊MP滤子的若干性质;研究了扰动模糊MP滤子的同态像和逆像。     

格蕴涵代数(∈,∈∨_(q(λ,μ)))-模糊子代数

本文从以下几个方面对格蕴涵代数的(∈,∈∨q(λ,μ))-模糊子代数进行了详细的研究。首先给出了点态化的(∈,∈∨q(λ,μ))-模糊子代数和广义模糊子代数的概念,讨论了两者之间的等价关系;其次给出了(∈,∈∨q(λ,μ))-模糊子代数的一些等价刻画,并研究了其相关性质;再次讨论了(∈,∈∨q(λ,μ))-模糊子代数的同态像与同态原像的基本性质;最后还研究了(∈,∈∨q(λ,μ))-模糊子代数的直积。     

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

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

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

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

N(2,2,0)代数的T-模糊子代数和T-模糊理想

为了深入研究N(2,2,0)代数的代数结构,在N(2,2,0)代数中引入了T模糊子代数和T模糊理想的概念,进一步讨论了它们的性质.分别给出了N(2,2,0)代数的模糊子代数和模糊理想与子代数和理想的关系.证明了N(2,2,0)代数的两个T模糊子代数的模交也是T模糊子代数,而N(2,2,0)代数的两个T模糊理想的模交也是T模糊理想.     

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

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

格值命题逻辑系统L（X）（I）

本文通过泛代数的概念与方法建立了以格蕴涵代数为真值域的格值命题逻辑系统Ｌ（Ｘ），并讨论了它的语义问题。     

Disturbing Fuzzy Propositional Logic and its Operators

In this paper, the concept of disturbing fuzzy propositional logic is introduced, and the operators of disturbing fuzzy propositions is defined. Then the 1-dimensional truth value of fuzzy logic operators is extended to be two-dimensional operators, which include disturbing fuzzy negation operators, implication operators, “and” and “or” operators and continuous operators. The properties of these logic operators are studied.     

中介命题演算系统$MP^{M}$的代数系统

MP~M系统是在中介逻辑系统的基础上建立起来的,用于处理数据库中不完全信息的三值逻辑命题演算系统．本文通过在MP~M系统上建立一个代数系统,对MP~M系统进行了代数抽象,讨论了MP~M系统的代数性质．本文还研究了该代数系统的次直积,以及与其它一些代数系统之间的关系．     

A coding method for a sequent calculus of propositional logic

The paper deals with a coding method for a sequent calculus of the propositional logic. The method is based on the sequent calculus. It allows us to determine if a formula is derivable in the calculus without constructing a derivation tree. The main advantage of the coding method is its compactness in comparison with derivation trees of the sequent calculus. The coding method can be used as a decision procedure for the propositional logic.     

电路问题的多角度分析

从数理逻辑、事件的独立性和指数分布函数等三个角度对电路问题进行分析,介绍不同数学知识在电路问题中的应用.     

Interpreting Intuitionistic Propositional Logic in Terms of Intuitionistic Protothetics

An algebra of sentences of the quite intuitionistic protothetics, that is, an intuitionistic propositional logic with quantifiers augmented by the negation of the excluded middle, is a faithful model of intuitionistic propositional logic.     

Amalgamation property for the class of basic algebras and some of its natural subclasses

We study Basic algebra, the algebraic structure associated with basic propositional calculus, and some of its natural extensions. Among other things, we prove the amalgamation property for the class of Basic algebras, faithful Basic algebras and linear faithful Basic algebras. We also show that a faithful theory has the interpolation property if and only if its correspondence class of algebras has the amalgamation property.     

Generalized valuations on MTL-algebras

In this paper, we study some kinds of generalized valuations on MTL-algebras, discuss the relationship between the cokernel of generalized valuations and types of filters on MTL-algebras. Then, we give some equivalent characterizations of positive implicative generalized valuations on MTL-algebras. Finally, we characterize the structure theory of quotient MTL algebras based on the congruence relation, which is constructed by generalized valuations. The results of this paper not only generalize related theories of generalized valuations, but also enrich the algebraic conclusion of probability measure, on algebras of triangular norm based fuzzy logic.     

Fuzzy-valued Propositional Logic FP~* (X)

Ｆｕｚｚｙ－ｖａｌｕｅｄＰｒｏｐｏｓｉｔｉｏｎａｌＬｏｇｉｃＦＰ~＊（Ｘ）￥ＱｉｎＫｅｙｕｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈ．，ＨｅｎａｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，４５３００２）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａｐｅｒ，ｗｅｔａｋｅ［０，１?..     

Fibered universal algebra for first-order logics

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing fibered algebraic semantics for general first-order logics. This framework includes a natural notion of substitution, which allows first-order logics to be considered as structural closure operators just as propositional logics are in abstract algebraic logic. We then establish an extension of the homomorphism theorem from universal algebra for generalized prop-categories and characterize two natural closure operators on the prop-categorical semantics. The first closes a class of structures (which are interpreted as morphisms of prop-categories) under the satisfaction of their common first-order theory and the second closes a class of prop-categories under their associated first-order consequence. It turns out that these closure operators have characterizations that closely mirror Birkhoff's characterization of the closure of a class of algebras under the satisfaction of their common equational theory and Blok and Jónsson's characterization of closure under equational consequence, respectively. These algebraic characterizations of the first-order closure operators are unique to the prop-categorical semantics. They do not have analogues, for example, in the Tarskian semantics for classical first-order logic. The prop-categories we consider are much more general than traditional intuitionistic prop-categories or triposes (i.e., topos representing indexed partially ordered sets). Nonetheless, to the best of our knowledge, our results are new, even when restricted to these special classes of prop-categories.     

EQ-algebras

We introduce a new class of algebras called EQ-algebras. An EQ-algebra has three basic binary operations (meet, multiplication and a fuzzy equality) and a top element. These algebras are intended to become algebras of truth values for a higher-order fuzzy logic (a fuzzy type theory, FTT). The motivation stems from the fact that until now, the truth values in FTT were assumed to form either an IMTL-, BL-, or MV-algebra, all of them being special kinds of residuated lattices in which the basic operations are the monoidal operation (multiplication) and its residuum. The latter is a natural interpretation of implication in fuzzy logic; the equivalence is then interpreted by the biresiduum, a derived operation. The basic connective in FTT, however, is a fuzzy equality and, therefore, it is not natural to interpret it by a derived operation. This defect is expected to be removed by the class of EQ-algebras introduced and studied in this paper. From the algebraic point of view, the class of EQ-algebras generalizes, in a certain sense, the class of residuated lattices and so, they may become an interesting class of algebraic structures as such.