Godel n值命题逻辑中公式的随机真度和形式推演结论的不可靠度估计

利用Godel n值命题逻辑赋值域上概率的无穷乘积,在Godeln值命题逻辑系统中引入命题公式的随机真度和不可靠度概念。证明在Godeln值逻辑系统中,一个有效推理结论的不可靠度不超过各前提的不可靠度与其必要度的乘积之和。通过不可靠度在全体公式集上建立伪距离,给出基于伪距离和不可靠度的两种近似推理模式。     

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

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

基于公式真度的公式集约简

基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。     

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

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

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

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

MV-代数赋值集上的拓扑及其在逻辑中的应用

在MV-代数全体赋值集Σ上建立拓扑D(称为赋值拓扑)并研究赋值拓扑的拓扑性质。证明赋值拓扑空间是紧Hausdorff拓扑。利用赋值拓扑的紧性证明Lukasiewicz命题逻辑系统和Lukasiewicz逻辑语义的紧性。     

命题逻辑系统中理论的发散度与近似推理的若干性质

基于演绎定理和完备性定理研究了二值命题逻辑系统、Lukasiewicz命题逻辑系统和R0-命题逻辑系统的理论的发散度与近似推理，获得了用Г中公式的真度表示其发散度的计算公式和若干可用于近似推理的不等式。     

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

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

模糊命题逻辑系统的计量化

在模糊命题逻辑系统中提出了公式的随机真度的概念,证明了模糊命题逻辑系统中有效推理的随机真度关系定理。运用随机真度关系定理证明了逻辑算子,→的连续性,给出了公式间距离的计算方法。最后,在系统L*中提出了三种近似推理模式,并讨论了它们之间的关系。     

Lukasiewicz n值命题逻辑中命题的真度理论

利用势为 n的均匀概率空间的无穷乘积在 Lukasiewicz n值命题逻辑中引入了公式的真度概念,当3≤n≤17时证明了全体公式的真度值之集在[0,1]上是稠密的,并给出了公式真度的表达通式;利用真度定义了公式间的相似度,进而导出了全体公式集上的一种伪距离,为n值Lukasiewicz命题逻辑系统的近似推理理论提供了一种可能的框架。     

On the recognition of the tautological nature of propositional formulas

A formal language whose propositions express (in some sense) the properties of propositional formulas is described in the paper. For a certain subset of propositions of this language it is proved that each of them defines a class of propositional formulas, on which it is possible to recognize the tautological nature in a time polynomially dependent on the formula's length.Translated fromZapiski Nauchnykh Seminarov Leningradskogo Matematicheskogo, Otdeleniyaim. V. A.Steklova Akad.Nauk SSSR, Vol. 60, pp. 197–206,1976. Result announced December 4, 1974.     

条件概率真度的相似度及伪距离

基于条件概率的思想,在连续值命题逻辑系统中引入赋值密度函数概念,给出了公式的概率真度、条件概率真度的定义,定义了公式间的相似度和伪距离并证明了概率真度的推理规则.     

The polynomial bounds of proof complexity in Frege systems

The concept of a determinative set of variables for a propositional formula was introduced by one of the authors, which made it possible to distinguish the set of hard-determinable formulas. The proof complexity of a formula of this sort has exponential lower bounds in some proof systems of classical propositional calculus (cut-free sequent system, resolution system, analytic tableaux, cutting planes, and bounded Frege systems). In this paper we prove that the property of hard-determinability is insufficient for obtaining a superpolynomial lower bound of proof lines (sizes) in Frege systems: an example of a sequence of hard-determinable formulas is given whose proof complexities are polynomially bounded in every Frege system.     

Iterated team semantics for a hierarchy of informational types

In this paper, we introduce and study a framework that is inspired by the team semantics for propositional dependence logic but deviates from it in several respects. Most importantly, instead of the two semantic layers used in dependence logic – possible worlds and teams – a whole hierarchy of contexts is introduced and different types of formulas are evaluated at different levels of this hierarchy. This leads to a rich stratification of informational types. In this framework, the dependence operator of dependence logic can be defined by the standard propositional connectives (negation, conjunction, disjunction and implication). We explore the formal aspects of this approach and apply it to a number of puzzling phenomena related to modalities and conditionals.     

An intuitionistic formula hierarchy based on high‐school identities

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e., sequent) isomorphisms corresponding to the high‐school identities, we show that one can obtain a more compact variant of a proof system, consisting of non‐invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalization procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non‐invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first‐order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism.     

Logic of agreement: Foundations,semantic system and proof theory

In this paper a multi-valued propositional logic — logic of agreement — in terms of its model theory and inference system is presented. This formal system is the natural consequence of a new way to approach concepts as commonsense knowledge, uncertainty and approximate reasoning — the point of view of agreement. Particularly, it is discussed a possible extension of the Classical Theory of Sets based on the idea that, instead of trying to conceptualize sets as “fuzzy” or “vague” entities, it is more adequate to define membership as the result of a partial agreement among a group of individual agents. Furthermore, it is shown that the concept of agreement provides a framework for the development of a formal and sound explanation for concepts (e.g. fuzzy sets) which lack formal semantics. According to the definition of agreement, an individual agent agrees or not with the fact that an object possesses a certain property. A clear distinction is then established, between an individual agent — to whom deciding whether an element belongs to a set is just a yes or no matter — and a commonsensical agent — the one who interprets the knowledge shared by a certain group of people. Finally, the logic of agreement is presented and discussed. As it is assumed the existence of several individual agents, the semantic system is based on the perspective that each individual agent defines her/his own conceptualization of reality. So the semantics of the logic of agreement can be seen as being similar to a semantics of possible worlds, one for each individual agent. The proof theory is an extension of a natural deduction system, using supported formulas and incorporating only inference rules. Moreover, the soundness and completeness of the logic of agreement are also presented.     

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.     

基于形式概念的对象粒的属性逻辑公式描述

基于形式概念在属性集上建立逻辑语言系统,证明基于形式概念的基本对象粒描述定理,讨论合取原子属性逻辑公式所描述对象粒的性质,提出一个求解描述对象粒的属性逻辑公式的算法。     

A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic

In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas.     

计量逻辑学的基本思想和研究综述

介绍计量逻辑学的形成、特点及其与模糊逻辑的异同。关于命题逻辑的计量化理论,针对不同的系统论述了真度理论和相似度理论,特别是介绍了作者提出的命题逻辑系统L*以及与其配套的R0代数理论和完备性定理。介绍了逻辑理论在逻辑度量空间中的发散度和相容的理论以及三种近似推理模式。回顾了谓词逻辑计量化的进程和有待解决的问题。提出了模态逻辑和模型检验的计量化问题以及有待进一步探讨的几个研究课题。