图灵机计算实数函数的稳定性

定义在全体实数上的可计算函数是一个很重要的概念．在这以前定义可计算的实数函数有两个途径．第一个途径是首先要定义可计算实数的指标．想要确定实数函数y=f（x）是不是可以计算就要看是否存在一个自然数的（部分）递归函数将可计算实数x的指标对应到可计算实数y的指标．这样一来对实数函数的研究依赖于对自然数函数的研究．第二个定义可计算的实数函数的途径是以逼近为基础的．一个实数函数是可以计算的如果它既是序列可计算的同时也是一致连续的．用这个途径来定义可计算实数函数使用的条件过强以至于很多有用的实数函数成为不可计算的实数函数．例如“〈”和“=”的命题函数就是不可以计算的因为它们是不连续的命题函数．本文讨论了图灵机的稳定性并且给出了一个基于稳定图灵机的可计算实数函数的定义．我们的定义不需要用到自然数的（部分）递归函数．根据我们的定义很多常用实数函数特别是一些不连续的常用实数函数都是可以计算的．用我们的定义来讨论可计算实数函数的性质比原来的定义要方便得多．     

错用罗素悖论-康托在集合论中的两个逻辑性错误

分析了罗素悖论与康托的实数集合不可数证明及康托定理S〈P（S）证明之间的本质性联系，发现康托的这两个非构造性证明与罗素悖论有完全相同的思路，但是康托犯了两个逻辑性错误而使他误用了这个悖论思路。得到明确的结论：康托在集合论中如上两个证明里的核心部分实际上是罗素悖论的翻版，这两个证明中的思路与做法是错误的，这样的证明结果没有科学性。     

在"高等数学"首堂课上讲授实数完备性

应用无穷小数来定义实数,可证明实数的完备性定理,并可在"高等数学"首堂课上严格地讲授.     

从普通集合到L—模糊集的扩充

在实数理论中,可以用一个有理数的退缩闭区间套的等价类来定义一个实数,并通过有理数的运算来引出实数的运算,从而完成从有理数域到实数域的扩充。与此类似,本文将用一个 L—集合套的等价类来定义一个 L—模糊集,通过普通集合论中集合的序关系与集合的运算来引出 L—模糊集的序关系与 L—模糊集的运算,并且通过普通集合的特征函数来定义 L—集合套与 L—模糊集的隶属函数,从而完成从普通集合到 L—模糊集的扩充。在(L,≤)中,我们不要求偏序≤是线性序。     

添加超实数而不加实数的力迫

本文研究了加强型Mathias力迫及其在不可数情形下的推广.通过力迫法,证明了Mathias力迫添加支配性实数,而加强型Mathias力迫添加的是无界、非支配性的实数.还证明了ω₁上的Mathias型力迫添加的是无界、非支配性的ω₁类实数且不添加新的实数.这些结论可应用于对实数上的基数不变量的研究.     

利用复数形式解实数问题的若干例

利用复数形式解实数问题的若干例夏大峰（安徽阜阳师范学院数学系２３６０００）众所周知，欧拉公式把复数的解析形式，指数形式和三角形式紧密地结合起来，使它们可以互相转化，在解复数问题时，往往可以转化为实数问题来处理，而本文介绍怎样把实数问题转化为复数形式来...     

集合论的孕育与诞生

集合论在数学中占有一个独特的地位,它的基本概念已渗透到数学的所有领域.按现代数学观点,数学各分支的研究对象或者本身是带有某种特定结构的集合如群、环、拓扑空间,或者是可以通过集合来定义的(如自然数、实数、函数).从这个意义上说,集合论可以说是整个现代数学的基础.集合论作为数学中最富创造性的伟大成果之一,是在19世纪末由德国的康托尔(1845—1918)创立起来的.但是,它萌发、孕育的历史却源远流长,至少可以追溯到两千多年前.1　无穷集合的早期研究集合论是关于无穷集合和超穷数的数学理论.集合作为数学中最原始的概念之一,通常是指…     

有关无限观的三个问题

2008年出版的《数学与无穷观的逻辑基础》第三篇（无穷观问题探索）中，有三个引人注目的内容．一是论述现代分析数学中存在着“新贝克莱悖论”；二是证明了令人惊奇的定理：“任何可数无穷集合都是自相矛盾的非集”；三是质疑了Cantor关于实数不可数的对角线证明方法的合理性．本篇评述立足于经典分析数学与Cantor-Zermelo—Halmos素朴集合论的理论基础上，经由分析指出了上述三项内容中的数学论证与推理是不能成立的。并解释了书中出错的主要原因．     

不等式的性质与证明

1．本单元重、难点分析本单元的重点： 1）理解不等式的性质及其证明．不等式的基本性质包括：比较实数大小的方法、五个定理和两个推论．比较两个实数a，b的大小通常转化为比较它们的差a-b与0的大小，而判断a-b的正负往往先要将其因式分解或配方．应注意五个定理和两个推论中有的是充要条件，有的是充分不必要条件．在充分不必要条件的应用中应注意最大值（或最小值）是否可以取到．     

指数幂与指数函数

在高中数学教材中,没有给出指数函数的严格定义,对其运算性质和单调性质足也没有严格证明.在大学中,这部分内容又一带而过,很少有参考资料.本文从初中学习过的正整数指数幂和整数指数幂出发,通过有理数指数幂的定义、性质和单调性,最后说明实数指数幂定义的合理性,给出实数指数幂性质的证明和实数指数幂函数连续性和单词性的证明,供老师参考.希望老师们能够从中了解哪些内容是需要定义的?哪些内容是需要证明的?重视定义的重要性.另外,数学是严谨的,但是对不同人的数学严格性要求的也是不同的,希望优秀的数学教师能够了解并思考指数函数单调性、连续性的证明思路和证明过程.     

A Real Number Structure that is Effectively Categorical

On countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations and the infinitary normed limit operator computable. This characterizes the real numbers in terms of the theory of effective algebras or computable structures, and is reflected by observations made in real number computer arithmetic. Demanding computability of the normed limit operator turns out to be essential: the basic operations without the normed limit operator can be made computable by more than one class of representations. We also give further evidence for the well-known non-appropriateness of the representation to some base b by proving that strictly less functions are computable with respect to these representations than with respect to a standard representation of the real numbers. Furthermore we consider basic constructions of representations and the countable substructure consisting of the computable elements of a represented, possibly uncountable structure. For countable structures we compare effectivity with respect to a numbering and effectivity with respect to a representation. Special attention is paid to the countable structure of the computable real numbers.     

A new infinite product representation for real numbers

We introduce a new algorithm that leads to a representation for any real number greater than one as an infinite product of rational numbers. Just as we can regard the Cantor product as being a product analogue of the series of Sylvester, this new product is analogous to the classical Engel representation for real numbers. The growth conditions satisfied by the digits in the product are likewise shown to correspond to those required for the Engel series. The representation for certain types of rational numbers via this algorithm is also considered.     

Powers of rationals modulo 1 and rational base number systems

A new method for representing positive integers and real numbers in a rational base is considered. It amounts to computing the digits from right to left, least significant first. Every integer has a unique expansion. The set of expansions of the integers is not a regular language but nevertheless addition can be performed by a letter-to-letter finite right transducer. Every real number has at least one such expansion and a countable infinite number of them have more than one. We explain how these expansions can be approximated and characterize the expansions of reals that have two expansions. The results that we derive are pertinent on their own and also as they relate to other problems in combinatorics and number theory. A first example is a new interpretation and expansion of the constant K(p) from the so-called “Josephus problem.” More important, these expansions in the base allow us to make some progress in the problem of the distribution of the fractional part of the powers of rational numbers. Work partially supported by the CNRS/JSPS contract 13 569, and by the “ACI Nouvelles Interfaces des Mathématiques”, contract 04 312.     

关于实数Cantor级数展开的一个注记

本文主要研究实数的Cantor级数展开式.通过构造Moran集的方法,确定了由Cantor级数中不同字符个数的渐近值所定义的一类集合的Hausdorff维数.本文结果可视为Erd¨os和Renyi关于Cantor级数统计性质研究的补充.     

关于实数Cantor级数展开的一个注记

本文主要研究实数的Cantor级数展开式. 通过构造Moran集的方法, 确定了由Cantor级数中不同字符个数的渐近值所定义的一类集合的Hausdorff维数. 本文结果可视为Erdös 和Renyi关于Cantor级数统计性质研究的补充.     

Teaching of real numbers by using the Archimedes–Cantor approach and computer algebra systems

Computer technologies and especially computer algebra systems (CAS) allow students to overcome some of the difficulties they encounter in the study of real numbers. The teaching of calculus can be considerably more effective with the use of CAS provided the didactics of the discipline makes it possible to reveal the full computational potential of CAS. In the case of real numbers, the Archimedes–Cantor approach satisfies this requirement. The name of Archimedes brings back the exhaustion method. Cantor's name reminds us of the use of Cauchy rational sequences to represent real numbers. The usage of CAS with the Archimedes–Cantor approach enables the discussion of various representations of real numbers such as graphical, decimal, approximate decimal with precision estimates, and representation as points on a straight line. Exercises with numbers such as e, π, the golden ratio ?, and algebraic irrational numbers can help students better understand the real numbers. The Archimedes–Cantor approach also reveals a deep and close relationship between real numbers and continuity, in particular the continuity of functions.     

��Ԫ�ع���ѡ���Ա�����һ�ּ򵥷���

在线性回归模型建模中, 回归自变量选择是一个受到广泛关注、文献众多, 具有很强的理论和实际意义的问题. 回归自变量选择子集的相合性是其中一个重要问题, 如果某种自变量选择方法选择的子集在样本量趋于无穷时是相合的, 而且预测均方误差较小, 则这种方法是可取的. 利用BIC准则可以挑选相合的自变量子集, 但是在自变量个数很多时计算量过大; 适应lasso方法具有较高计算效率, 也能找到相合的自变量子集; 本文提出一种更简单的自变量选择方法, 只需要计算两次普通线性回归: 第一次进行全集回归, 得到全集的回归系数估计, 然后利用这些回归系数估计挑选子集, 然后只要在挑选的自变量子集上再进行一次普通线性回归就得到了回归结果. 考虑如下的回归模型: 其中回归系数中非零分量下标的集合为, 设是本文方法选择的自变量子集下标集合, 是本文方法估计的回归系数(未选中的自变量对应的系数为零), 本文证明了, 在适当条件下, 其中表示的 分量下标在中的元素的组成的向量, 是误差方差, 是与 矩阵极限有关的矩阵和常数. 数值模拟结果表明本文方法具有很好的中小样本性质.     

Characterizing an ℵ ∈ -saturated model of superstable NDOP theories by its\mathbb{L}_{\infty ,\aleph _ \in ^ - } -theory

Assume a complete countable first order theory is superstable with NDOP. We know that any ? _∈ -saturated model of the theory is ? _∈ -prime over a non-forking tree of “small” models and its isomorphism type can be characterized by its $\mathbb{L}_{\infty ,k} $ (dimension qualifiers)-theory, or, if you prefer, appropriate cardinal invariants. We go one step further by providing cardinal invariants which are as finitary as seem reasonable.     

Stable intersection of affine Cantor sets defined by two expanding maps

It is shown that in the context of affine Cantor sets with two increasing maps, the arithmetic sum of both of its elements is a Cantor set otherwise, it is a closure of countable union of nontrivial intervals. Also, a new family of pairs of affine Cantor sets is introduced such that each element of it has stable intersection. At the end, pairs of affine Cantor sets are characterized such that the sum of elements of each pair is a closed interval.