经典错误逻辑的相似转化词

经典错误逻辑研究的是错误传递、转化的规律,它为决策中避免错误,消除错误,减小错误的危害提供了新的方法.相似转化词是经典错误逻辑中的一个重要转化词,定义了相似转化词的概念,研究了这个转化词所具有的性质和规律.     

模糊错误逻辑的组合转化词分析

模糊错误逻辑研究的是错误传递、转化的规律,它为决策中避免错误,消除错误,减小错误的危害提供了新的方法.组合转化词是模糊错误逻辑中的一个重要转化词,定义了组合转化词的概念.分析了这个转化词的性质和运算规律.     

模糊错误逻辑的增加转化词及其在规避金融衍生交易风险中的应用

研究模糊错误逻辑的增加转化词在错误的传递、转化与消除过程中的性质和规律,建立了避免金融衍生交易风险的数学模型,介绍了增加转化词在避免金融衍生交易风险中的应用方法。     

不确定性环境下消错决策方法的研究

针对不确定性决策问题,本文首先给出了错误的概念并提出本研究的两个假设前提,然后在此基础上引出错误绝对损失值的概念,根据错误绝对损失值构建错误绝对损失矩阵。进而构建了消错离心法、消错理想点法和消错投影法三种决策方法。为构建消错组合决策模型,采用Copeland法对上述三种消错决策方法进行组合。最后通过实例说明该方法的有效性和可行性。     

模糊错误逻辑分解转化词与内涵否定词的逻辑关系

在文 [1]的基础上 ,在简单分析现时中错误的传递与转化的实际存在的同时 ,介绍国内外在逻辑研究领域对事物传递与转化规律的研究现状。特别为了探索控制与防范证券风险的技术而主要研究模糊错误逻辑分解转化词与内涵否定词的逻辑关系。     

风险型混合多属性消错决策方法

针对同时包含可线性补偿和不可线性补偿两种属性且属性值为确实数、区间数、语言信息的风险型多属性决策问题,提出一种基于消错理论的决策方法。首先,在消错理论的基础上将属性分为关键型、重要型和冗余型三类,结合属性值的类型分别给出对应的错误函数和极限损失值;接着,对关键型属性赋予极小权重,在保留关键型属性“一票否决”功能的同时又突出重要属性的作用;最后,根据对待错误损失的不同态度,建立计算错误损失值的三种方法,通过计算期望错误损失值对备选方案进行排序。通过新市民信息服务项目的例子,说明该方法的有效性和可行性。     

错误评价及其消错优化研究

现实中决策者往往希望将评价对象的特征值与期望值之间的偏差控制在可接受范围之内,而且偏差越小越好.基于消错学对错误的界定,利用错误函数对评价对象的特征指标值与评价标准之间的偏差进行了度量,并遵循"区分主次、明确底线、综合集成"的思路,通过建立消错规划模型实施消错优化,从而在保证各特征指标不突破临界错误值的情况下,做到评价对象的整体错误值最小化.最后通过算例分析,演示了消错优化的过程,验证了消错优化模型的合理性和可操作性.     

模糊逻辑函数中短语的可消性

设Ｆ＝ａＰ＋ａ＿１Ｐ＿１＋……＋ａ＿ｍＰ＿ｍ是非冗余析取范式，本文获得了当ａ＞０．５时，ａＰ可消当且仅当ａＰ是冗余项，当ａ≤０．５时，给出了ａＰ可消的一个判别准则，然后归纳出短语可消性的判定法则。     

基于消错理论的大学生就业供需矛盾研究

把消错学应用于大学生就业供需矛盾问题,通过建立就业供需矛盾问题的错误模型,并用消除错误的十五、六、三方法来分析错误发生的原因和机制,研究错误传递、转化的方法和关系,最后辅以实例.     

关键重要型多属性消错决策方法

针对属性为关键重要型的多属性决策问题,利用消错理论提出一种新型的决策方法.首先,依据消错理论给出错误、错误极限损失值、关键重要型属性等概念;接着,根据多属性决策问题的特征给出判断属性值错误与否的规则;再接着,通过建立错误函数计算属性错误值,并依据错误值确定可行策略集;然后,利用消错离心法对可行策略进行排序与选优.最后,通过将所提出的新型决策方法与其他方法相比较,以说明其科学性和可行性.     

论谓词逻辑推理中的量词加免法则

对谓词逻辑推理中关于量词加免的四项法则重新进行了审定，并讨论了这些法则的使用技巧。     

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

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

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.     

The Operators of Vector Logic

Vector logic is a mathematical model of the propositional calculus in which the logical variables are represented by vectors and the logical operations by matrices. In this framework, many tautologies of classical logic are intrinsic identities between operators and, consequently, they are valid beyond the bivalued domain. The operators can be expressed as Kronecker polynomials. These polynomials allow us to show that many important tautologies of classical logic are generated from basic operators via the operations called Type I and Type II products. Finally, it is described a matrix version of the Fredkin gate that extends its properties to the many-valued domain, and it is proved that the filtered Fredkin operators are second degree Kronecker polynomials that cannot be generated by Type I or Type II products. Mathematics Subject Classification: 03B05, 03B50.     

概率逻辑学基本定理在多值命题逻辑系统中的推广

通过引入概率测度空间,在n值Lukasiewicz命题逻辑系统中提出了满足Kolmogorov公理的命题公式的概率;证明了概率逻辑学基本定理,并将概率逻辑学基本定理推广到了更一般的形式,改进了对推理结论的不可靠度上界的估计;将概率逻辑学的基本方法引入计量逻辑学,建立了更一般的逻辑度量空间;通过概率逻辑学基本定理,证明了逻辑度量空间中概率MP,HS规则,它是真度MP,HS规则的推广.     

Infinitary S5-Epistemic Logic

It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some given cardinality) are permitted in the language. We develop a strengthened S5-axiomatic system for such infinitary logics, and prove a strong completeness theorem for them. Then we show that in every such logic there is always a theory with more than one model.     

Well-Defined Fuzzy Sentential Logic

A many-valued sentential logic with truth values in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper develops some ideas of Goguen and generalizes the results of Pavelka on the unit interval. The proof for completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if and only if the algebra of the truth values is a complete MV-algebra. In the well-defined fuzzy sentential logic holds the Compactness Theorem, while the Deduction Theorem and the Finiteness Theorem in general do not hold. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning.     

有关度量加的几个几何不等式

本文利用代数的方法建立了一个与距离几何中度量加单形的体积和外接超球半径有关的几何不等式,作为其应用,由此可以导出一系列重要的几何不等式.在文末还给出了“广义度量加”的概念,并提出若干猜想供进一步研究.     

Full Models for Positive Modal Logic

The positive fragment of the local modal consequence relation defined by the class of all Kripke frames is studied in the context of Abstract Algebraic Logic. It is shown that this fragment is non‐protoalgebraic and that its class of canonically associated algebras according to the criteria set up in [7] is the class of positive modal algebras. Moreover its full models are characterized as the models of the Gentzen calculus introduced in [3].