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.     

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.     

A Sequent Calculus for Propositional Dynamic Logic for Agents

We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.     

格值命题逻辑系统LP(X)的语法扩张

We have given a semantic extension of lattice-valued propositional logic LP(X) in [6]. In this paper, we investigate its corresponding syntactic extension of LP(X) and give the relations between these two extensions.     

A secondary semantics for Second Order Intuitionistic Propositional Logic

In this paper we propose a Kripke‐style semantics for second order intuitionistic propositional logic and we provide a semantical proof of the disjunction and the explicit definability property. Moreover, we provide a tableau calculus which is sound and complete with respect to such a semantics. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

三值R_0命题逻辑系统中理论的随机发散度

在三值R_0命题逻辑系统中,给出了随机相似度和随机逻辑伪距离的基本性质.然后在随机逻辑度量空间中提出了理论的随机发散度,指出全体原子公式之集在随机逻辑度量空间中未必是全发散的,其是否全发散取决于给定的随机数序的分布.     

Boole代数上的度量结构及其在命题逻辑中的应用

设B是一个Boole代数, Ω是从B到Boole代数{0,1}的全体同态之集,μ是Ω上的概率测度.本文基于μ在B中引入了元素的尺寸概念以及元素对之间的相似度概念,并由此在B上建立了度量结构.作为应用,本文改进了新近提出的命题逻辑中的近似推理理论.     

Propositional union closed team logics

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.     

格值命题逻辑系统LP(X)的闭包算子

In this paper, closure operators of lattice-valued propositional logic LP(X) are studied. A family of classical closure operators are defined and the relation between them and closure operators of LP(X) is investigated. At the same time, a tool for checking compactness of LP(X) is given.     

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 261–269, April–June, 2005.     

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

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

经典命题逻辑中的近似推理与强近似推理

基于命题逻辑公式之间相似度的概念,在经典命题逻辑系统中提出了两种近似推理模式,得到了它们的一些基本性质。讨论了这两种推理模式与经典推理模式之间的关系。此外,当理论Γ有限时,本文分别给出Γ在α程度上近似推出公式A和理论Σ的充要条件。最后,我们给出公式A与有限理论Γ的结论集D(Γ)之间距离的计算公式。     

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...     

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

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

Theories in Classical Propositional Logic and the Converse of Substitution

We study theories based on the classical propositional logic. As follows from the Sushko lemma, for any classical propositional theory T and any substitution ε (where formulas stand in place of propositional variables), the set ε−1(T) is also a classical propositional theory. In this paper, we strengthen this assertion, namely, we prove that for any consistent finitely axiomatizable classical propositional theory T there exists a substitution e such that T is the inverse image of the set of all tautologies under ε. We propose an algorithm for constructing such a substitution for a given axiom of the theory.     

二值命题逻辑中基于前提信息的近似推理理论

以真度为基础,给出二值命题逻辑系统中基于前提信息的相似度和伪距离的概念以及伪距离的真度表示式,对二值命题逻辑中具有前提信息的近似推理问题进行讨论.     

命题逻辑公式的压缩表示及其相应的形式系统

提出一种将命题逻辑公式压缩表示的方法--公式的压缩图,给出相应的形式系统,并证明该系统的证明效率比传统相继式演算系统Gentzen\{cut}有指数级的提高,从而为命题逻辑提供了一种新的有效的推理系统.     

二值命题逻辑中理论的发散性、相容性及其拓扑刻画

在二值命题逻辑系统中基于逻辑度量空间(F(S),ρ)而建立起了逻辑理论的发散性、相容性和理论的拓扑性质之间的联系。证明了逻辑理论Г是全发散的当且仅当D(Г)在(F(S),ρ)中稠密,闭理论Г是相容的当且仅当Г在(F(S),ρ)中不含内点,证明了(F(S),ρ)是零维空间,并具有一种类似于樊畿性质的所谓“有限等球连通性”．     

L—Fuzzy命题逻辑系统的语构分层方案

建立一种L－Fuzzy命题逻辑的语构分层构造,引进诸如λ－信息,λ－公理系,λ－语构,λ－证明,λ－定理,λ－语构结论,λ－语构闭包,λ－紧性,,上L－Fuzzy语构闭包,下Fuzzy语构闭包,λ－语构分层和谐,语构分层和谐,强语构分层和谐等新的观念和方法,从而L－Fuzzy命题逻辑语构和语义分层次的程度化的和谐性度量提供了一种方案。