基于逻辑关系的数学模型—逻辑模型的理论与分析

用数学模型研究实际问题是现代科学研究的常用方法.通常采用的数学模型是各种方程.但是使用方程作为研究手段也存在着许多问题,例如无法应用于不可计算的或者不具有数量概念的实际情况中,这样许多问题无法加以讨论.以命题为基础,通过数理逻辑的概念和方法,建立了具有实际意义的逻辑模型的一般理论,分析了逻辑模型的一些基本性质.逻辑模型可以看成传统模型的一种推广.     

不完全三值逻辑在语言表达上的相互比较

深入讨论各种命题联结词含量不完全的三值逻辑的语言表达的能力,完全弄明白了三值系统L3,L3,B3,B3,K3,K3,MP的语言表达能力的等效或不等效关系,特别应当指出的一个结论是：中介命题逻辑MP作为一种命题联结词含量不完全的三值系统而言,它和其他命题联结含量不完全的三值逻辑L3,L3Δ,B3,B3Δ,K3,K3Δ的语言表达能力都不等效,从而也由此体现出MP的一种自身特色。     

关于命题的讨论

“简易逻辑”一节 ,是高中新教材中新增加的内容 .对于这部分内容 ,在初中教材及原高中教材中虽零星出现过 ,但都没系统地加以讨论研究 ,因此 ,许多教师会感到心中没底 ,而这部分内容 ,无论是学生对初中所学数学知识进行系统总结 ,以加深提高自己的数学水平 ,还是对今后高中阶段数学知识的顺利学习 ,都是至关重要的 ;每一个教师更是要弄清吃透 .为此 ,我们就“命题”这一简易逻辑中最基本也是比较重要的概念 ,作如下简要的解释说明 ,以期各位同仁商榷指正 ,达到共同提高的目的 .1　关于命题定义的理解“命题”这一概念在初中平面几何中有过…     

简易逻辑学习中常遇问题及其对策

简易逻辑是新教材中新增加的内容，这部分内容主要涉及逻辑学中最基本、最简单的知识，目的是让学生能使用逻辑规划来弄清楚命题之间的逻辑关系．其中逻辑联结词“或”、“且”、“非”及简单命题、复合命题等概念的理解，命题的真假判断与应用，四种命题及其关系，充要条件的概念及两命题间充要关系的判断与证明，不仅是每年高考关注的热点，也是同学们在学习时容易产生误解的地方．[第一段]     

简易逻辑知识解读点滴

数学是一门逻辑性很强的学科 .学习数学时 ,处处涉及命题之间的逻辑关系和推理论证 .高中数学新教材“简易逻辑”结合中学数学内容 ,介绍一些简单而又实用的逻辑知识 ,使学生进一步弄清命题与命题之间的逻辑关系 ,增强判断是非的能力和推理能力 ,避免一些易犯的逻辑错误 ,从而有助于学生学好数学 .但作为我们中学数学一线教师 ,往往都没有系统地学习过逻辑学 ,对逻辑知识存在一定的认知缺陷 .本文结合自身的教学实践 ,谈点肤浅的认识 ,敬请同仁斧正 .1　命题与判断初高中共有两次命题的定义 ,初中数学为了便于学生接受 ,给命题下的定义是 :…     

简易逻辑中的错解浅析

在简易逻辑的教学中 ,常因为对逻辑联结词的使用不当而导致一些错解 .本文将就一些常见的错解进行分析 ,供读者参考 .例 1　 ｐ :9的平方根是 3.写出非 ｐ并判断真假 .错解　有人认为非 ｐ是“9的平方根不是 3” .并认为“9的平方根不是 3”是一个假命题 ,从而出现ｐ与非 ｐ均是假命题 .上述解法中存在两个问题 .①非 ｐ的写法不正确 .一个命题的否定并非是在命题的结论前添加否定词就能完成的 .正如文 [1]所指出的那样 ,当命题中含有全称量词或存在量词时 ,命题的否定应对量词作适当的调整 .事实上 ,例 1中的命题 ｐ隐含着全称量词 ,ｐ等价…     

关于高等数学中的逻辑证明

逻辑证明在高等数学及其教学中占有重要地位，本着重从间接证明尤其是反证法的逻辑结构入手，剖析了高等数学中的范例，反证法离不开充分条件假言推理的否定后件式，其中的后件“q”可以是直言命题或关系命题，也可以是联言命题，选言命题，假言命题和负命题。     

同主语同标签Vague命题的Lawry逻辑

给出了Lawry不确定模型的新的性质.基于Lawry模型,引入了同主语同标签Vague命题的Lawry真度的概念.由此,提出了一种非经典逻辑,称为同主语同标签Vague命题的Lawry逻辑,简称Lawry逻辑.其逻辑规律表明它与经典逻辑具有优良的和谐性.     

对逻辑联结词再理解

高中数学新教材“简易逻辑”中规定 :“或”、“且”、“非”这些词叫做逻辑联结词 .不含逻辑联结词的命题是简单命题 .由简单命题与逻辑联结词构成的命题是复合命题 .根据以上定义 ,如何解释“方程 (ｘ - 1 )(ｘ - 2 ) =0的根是ｘ =1或ｘ =2”是简单命题还是复合命题呢 ?如果是简单命题 ,那么又怎样对语句中的“或”作解释呢 ?如果是复合命题 ,那么由“方程 (ｘ - 1 )(ｘ - 2 ) =0的根是ｘ =1”是假命题 ,“方程(ｘ - 1 ) (ｘ - 2 ) =0的根是ｘ =2”也是假命题得 :复合命题“方程 (ｘ - 1 ) (ｘ - 2 ) =0的根是ｘ =1或ｘ =2”也是假命题 .…     

辨析命题的否定、命题的否命题

在简易逻辑这一节中，我们学习了命题的概念，在这一节中出现了两个极易混淆的概念：命题的否定与命题的否命题．     

Classification of Novikov Complete Logics with Extra Logical Constants

We give an exhaustive classification of Novikov complete extensions of the intuitionistic propositional logic in a language with extra logical constants.     

Foundation of credibilistic logic

In this paper, credibilistic logic is introduced as a new branch of uncertain logic system by explaining the truth value of fuzzy formula as credibility value. First, credibilistic truth value is introduced on the basis of fuzzy proposition and fuzzy formula, and the consistency between credibilistic logic and classical logic is proved on the basis of some important properties about truth values. Furthermore, a credibilistic modus ponens and a credibilistic modus tollens are presented. Finally, a comparison between credibilistic logic and possibilistic logic is given.     

A dynamical approach to logical decisions

We propose a first approximation to the modeling of cognitive decisions based on the theory of associative memories. The basic structure are the matrix memories of Anderson-Kohonen adapted to include the modulation of associations via tensorial preprocessing of inputs. This view admits an easy implementation of logical operations as matrix operators. From this “vectorial logic” springs a variety of models for fuzzy decision processes. Degrees of fuzziness are introduced at two different levels: (a) by the operators of modal logic, and (b) by using logical variables as vectors with projections inside the interval [0, 1]. The outcomes of this vectorial logic can be projected onto unit vectors yielding scalar difference equations. As examples we study the dynamics of contradictory self-referential systems and processes leading to competition between options. These models exhibit a variety of dynamical patterns that include stable steady states, oscillations, and deterministic chaos. © 1997 John Wiley & Sons, Inc.     

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

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

有限可补格上的格值逻辑的特征

本文给出了有限可补格上的格值逻辑的特征,即如果L是一个强于L_1的正则逻辑系统并且L有紧致性和LS性质,则L～L_1.     

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.     

From the Logical Square to Blanché’s Hexagon: Formalization, Applicability and the Idea of the Normative Structure of Thought

The square of opposition and many other geometrical logical figures have increasingly proven to be applicable to different fields of knowledge. This paper seeks to show how Blanché generalizes the classical theory of oppositions of propositions and extends it to the structure of opposition of concepts. Furthermore, it considers how Blanché restructures the Apuleian square by transforming it into a hexagon. After presenting G. Kalinowski??s formalization of Blanché??s hexagonal theory, an illustration of its applicability to mathematics, to modal logic, and to the logic of norms is depicted. The paper concludes by criticizing Blanché??s claim according to which, his logical hexagon can be considered as the objective basis of the structure of the organisation of concepts, and as the formal structure of thought in general. It is maintained that within the frame of diagrammatic reasoning Blanché??s hexagon keeps its privileged place as a ??nice?? and useful tool, but not necessarily as a norm of thought.     

A case study in logical deconstruction: Formalizing J.D. Thompson's Organizations in Action in a multi-agent action logic

Logic is a popular word in the social sciences, but it is rarely used as a formal tool. In the past, the logical formalisms were cumbersome and difficult to apply to domains of purposeful action. Recent years, however, have seen the advance of new logics specially designed for representing actions. We present such a logic and apply it to a classical organization theory, J.D. Thompson's Organizations in Action. The working hypothesis is that formal logic draws attention to some finer points in the logical structure of a theory, points that are easily neglected in the discursive reasoning typical for the social sciences. Examining Organizations in Action we find various problems in its logical structure that should, and, as we argue, could be addressed.     

“Setting” n-Opposition

Our aim is to show that translating the modal graphs of Moretti’s “n-opposition theory” (2004) into set theory by a suited device, through identifying logical modal formulas with appropriate subsets of a characteristic set, one can, in a constructive and exhaustive way, by means of a simple recurring combinatory, exhibit all so-called “logical bi-simplexes of dimension n” (or n-oppositional figures, that is the logical squares, logical hexagons, logical cubes, etc.) contained in the logic produced by any given modal graph (an exhaustiveness which was not possible before). In this paper we shall handle explicitly the classical case of the so-called 3(3)-modal graph (which is, among others, the one of S5), getting to a very elegant tetraicosahedronal geometrisation of this logic.