常系数线性微分方程RMI解题机

本文介绍的常系数线性微分方程解题机是利用数学方法论的研究成果，摸拟人的数学思维过程，采用关系映射反演（ＲＭＩ）方法，通过符号推理给出微分方程解析解的数学软件．文中介绍了研制该解题机的基本思想和实现技术，并给出了用解题机求解微分方程和微分方程组的几个实例．     

论Gdel不完备性定理

本文首先借用延伸,穷竭的概念,界定了数学中的潜无限与实无限,进而讨论了延伸变程的层次概念与穷竭原则的相对性。最后,借此分析了著名的Gdel不完备性定理的证明思想,指出了不完备性定理及其证明的实质性根据是:任何低一层次的无穷过程恒不能列举或判定相应的而又比它高一层次的无穷总体的全体元(这就是所谓“层次不可越原理”)。 本文的基本思想内容曾在大连工学院“数学方法论讲座”中报告过。     

中介公理集合论系统MS

本文概述中介公理集合论MS中有关“两种谓词的划分与定义”、“集合的运算”、“谓词与集合”、“小集与巨集”、“MS与ZFC的关系”、“逻辑数学悖论在MS中的解释方法”等文中的定义、引理和定理。     

数学无穷与中介逻辑(上)——Leibniz的割线与切线问题在中介逻辑中的逻辑数学解释方法(英文)

From the perspective of potential infinity (poi) and actual infinity, Ref [4] has confirmed that poi and aci are in ’unmediated opposition’ (P,﹁P ) whether in ZFC or not; it has further been proved that the manners in which a variable infinitely approaches its limit also satisfy the law of intermediate exclusion. With these results as theoretical bases, this paper attempts to provide an accurate and strict logical-mathematical interpretation of the incompatibility of Leibniz’s secant and tangent lines in the medium logic system from the perspective of logical mathematics.     

两点意见

(Ⅰ)莫绍揆先生在[1]中指出:‘据说有一个克利特岛人说:“凡克利特岛人都说谎”。结果无论这句话是真是假,都引起矛盾’。继之又在[2]中第34页写道:‘古希腊时代一个克利特岛上的人说:“克利特岛上的人是说谎者”。如果这句话真,则他自己(是克利特岛人)便说谎,从而这句话假。如果这句话假,则克利特岛人不说谎,而这句话可为真。人们认为,如果那个克利特岛人的话进一步改为:“我这句话是假的”。那末悖论便更明显了’。实际上,如上两次提及的原始命题是公元前六世纪克里特哲学家Epimenides所提出,但很     

级数求和RMI解题机

本文从RMI原则出发对各种级数求和的方法进行分析,将许多幂级数归结为是由几种基本幂级数演变而来的,总结出若干适用面较广的映射算子,介绍了在此基础上实现的能对相当大一部分幂级数及数项级数求和的RiMI解题机.     

论G?del不完备性定理

The object of this expository paper is to disclose the real essential idea involved in G?del's imcompleteness theorem through a detailed analysis of the proof presented in Arbib's booklet. In §1 very extensive definitions have been given of the potential infinite and the real infinite, respectively. In §2 the general concept concerning types of infinite extension processes as well as the principle of relatively complete exhaustion have been expounded. In§3 a deeper analysis has been made of the well-known proof of G?del's imcompleteness theorem, thus leading to the conclusion that G?del's theorem is actually implied by the most general principle that any infinite process of lower type cannot exhaust and exhibit the whole content of the corresponding process with relatively higher type, where the words "exhaust" and "exhibit" may be given precise meanings in certain special cases including the case for G?del's arithmetic logic.