经典公理集合论系统与中介公理集合论系统之间的包含关系

本文首先在中介公理集合论系统ＭＳ中构造出Ｐｅａｎｏ自然数系统，以此为基础重新定义了ＭＳ中的良集概念，证明了新定义的良集满足经典公理集合论系统ＺＦＣ^－（ＺＦＣ中去掉正则公理的集合论系统）的全部公理，从而说明经典公理集合论系统ＺＦＣ^－为中介公理集合论系统ＭＳ的子系统．     

浅谈“归纳”思想在初中阶段的渗透

“归纳法”(指不完全归纳法)安排在高中阶段,是继“数列”之后引入的。它推理的基本形式是: x_1具有性质G, x_2具有性质G, x_3具有性质G, ………………x_n具有性质G。{x_1、x_2、x_3…x_n}是集合A的真子集。推断集合A的任一元素x具有性质G。这种或然推理的结论有待于证明。它在人     

用数学归纳法证明一类不等式的技巧

对于一边是常数的数列不等式，在用数学归纳法直接证明时，归纳过渡往往有一定的困难，若利用不等式的传递性、可加性等性质，通过强化命题，放缩常数等技巧，就可顺利完成归纳过渡，下面举例说明．     

L-Fuzzy拓扑空间的层分离性公理

在一般L-fuzzy拓扑空间中引入一套新的分离性公理。即层分离性公理。并研究其性质．讨论层分离性公理与L-fuzzy拓扑空间中的第一套分离性公理间的关系。表明前者比后者弱且两者有很好的协调性。     

中学"边角边"公理教学中的思考

0 引言 近年来,在中学数学课程的不断调整过程中,一个一直有争议的问题是如何处理几何教程中的公理.这个问题也涉及对希尔伯特公理体系的理解,事实上,希尔伯特当初建立一个完整的欧几里德几何公理体系,是为了回答当时很多人对欧几里德几何的严格性的质疑.这个问题是"初等的"几何,但它本身绝不是初等的,恰恰相反,它是很深很困难的,是当时数学的顶尖工作(在今天属于数理逻辑的范围).这项工作说明,欧几里德几何体系完全可以严格化和完备化,并且是不矛盾的.但严格化的方法并不止一种,例如张景中就曾给出与希尔伯特公理体系等价的其他公理休系.     

有关《三角形的全等判定》教学的一个想法

在现行课本中 ,三个三角形全等判定的公理顺序为 :边角边 ,角边角 ,边边边 .在此我有一个教学的想法 ,将前两个公理的教学顺序交换一下 .这个想法来源于我对角边角公理的一次教学过程的设计 .1　角边角公理教学过程设计的中心内容对于角边角公理的教学过程我分了三个部分 :公理的引入 ,公理的明确 ,公理的巩固 .与教材不同的是 ,我用一个生活中的实例设计问题情景引入公理 .这就是问题一 :有一块三角形玻璃碎成如图所示的两块 ,如果要将其复原 ,是不是两块都要带去 ?面对这样的问题学生有了兴趣而且议论纷纷 ,答案不一 .在此时教师应提出问…     

浅议利用数学归纳法解题

浅议利用数学归纳法解题孟小龙在数学中，经常会遇到关于任意正整数ｎ的一些命题，这些命题其实是由无限个ｎ取具体正整数时的命题组成的．我们当然不能去逐一验证．这时，用数学归纳法往往十分奏效．数学归纳法是由数学中归纳公理得来的，它的原理如下：要证明一个和自然...     

对中学“数学归纳法”教材教法的几点思考

1 数学归纳法是数学中一种重要而独特的证明方法。对与自然数n有关的命题的证明一般是行之有效的。它使学生了解一种“化无限为有限”的辨证思维方法。然而,现行教材没有给出它成立的依据,而且它又不是那么直观易懂     

数学归纳法的构造

数学归纳法是数学中最基本也是最重要的方法之一.它在各个数学分支领域中都有着极为广泛的应用,正确地掌握并灵活地应用此方法是数学教学的基本要求之一.数学归纳法具有多种形式,无论何种形式其核心都是必不可少的两个基本步骤.对于各种具体问題选用适宜的数学归纳法形式以使两个基本步骤得以实现是解决问题的重要一环.这方面已有不少论著作出广泛的讨论.本文的主要目的在于给出数学归纳法的一个一般性定理,由此不仅可以     

论优化问题的公理方法（Ⅰ）

π－簇表示论域Ω上具有性质π的集合簇：≠；当Ａ，Ｂ∈，Ｂ∈，ＸＡ，总有Ｘ，Ａ∪Ｂ∈．定义２在π－簇上，＊是优化算子，如果公理１Ａ对应唯一的子集合Ａ＊．写Ａ＝Ａ＊∪，Ａ＊∩Ａ＝；公理２；．定义３在定义２中，还满足公理３若ＡＣ，则ＡＣ；公理４（Ａ＊∪Ｂ）＊（Ａ∪Ｂ），则说算子＊是上的第一类优化算子．对此，建立了两个优化原理，还给出了几个关于这种算子＊的例子．     

Variation on a theme of Schütte

Let ? be a primitive recursive well‐ordering on the natural numbers and assume that its order‐type is greater than or equal to the proof‐theoretic ordinal of the theory T. We show that the proof‐theoretic strength of T is not increased if we add the negation of the statement which formalizes transfinite induction along ?. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Mathematical induction,difference equations and divisibility

Many exercises in mathematical induction require the student to prove a divisibility property of a function of the integers. Such problems are generally presented as being independent of each other. However, many of these problems can be presented in terms of difference equations, and the theory of difference equations can be used to provide a uniform method for creating such divisibility problems. This article shows how a multitude of such problems can be created, and how standard problems from textbooks can be analysed in terms of difference equations.     

Large normal ideals concentrating on a fixed small cardinality

The property on the filter in Definition 1, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh484] and is proved consistent as required there (see Conclusion 6). A natural property which looks better, not only is not obtained here, but is shown to be false (in Claim 7). On earlier related theorems see Gitik Shelah [GiSh310]. On such games see e.g. [Je], [Sh-b], [Sh-f]. Received June 27, 1994     

Emergence and induction of cellular automata rules via probabilistic reinforcement paradigms

Two simple models of emergence and automated induction are described. In the first, an initially random process comes, over time, to emulate a deterministic process with noise. In the second, an induction algorithm is used to make unbiased best guess estimates of cellular automata rules generating a given time series of binary strings. The general conclusions are as follows: (1) that it may not be possible to distinguish between a stochastic process with selection and reinforcement and a noisy deterministic process; and (2) automated induction algorithms will often be vulnerable to errors of type 1 when faced with random data. In this second case, this leads to a method for study of the modeling class assumed in the induction algorithm. © 2006 Wiley Periodicals, Inc. Complexity 11: 44–57, 2006     

用连续归纳法证明实数系中的定理

引入实数的连续归纳法,并利用实数连续归纳法证明了实数系中的C auchy收敛准则;给出并证明了实数连续归纳法的另一种形式,利用新形式的连续归纳法证明单调有界定理.     

A prediction of the acoustical properties of induction cookers based on an FVM–LES-acoustic analogy method

The FVM–LES-acoustic analogy method (FVM–LES-AAM), which is a hybrid prediction technique for the acoustical property computation, is presented and performed in this paper. The FVM–LES-AAM was developed by combining the finite volume method (FVM), the large eddy simulation (LES), and the Ffowcs Williams-Hawkings analogy algorithm (FWH-AA). To predict the acoustical properties of induction cookers, the FVM is used for discretizing the calculation field and building numerical equations, and the LES and FWH-AA are performed for computing the sound sources and predicting the far-field sound, respectively. Using the FVM with the unstructured grids method to discretize the control equation of Navier–Stokes was introduced for illuminating the above numerical simulation procedure. To prove the FVM–LES-AAM method is feasible for predicting the acoustical property of induction cookers, the simulated results were compared with some measured experimental data. The comparisons suggest that the hybrid method is accurate and reliable for the aeroacoustics analysis of induction cookers. Considering the temperature performance, furthermore, some new configurations for the noise reduction of induction cookers were designed, simulated, and discussed. The FVM–LES-AAM prediction technique shows promise as a feasible and computationally affordable approach for not only noise analysis of induction cookers, but also for other aeroacoustics problems in engineering.     

关于Alzer不等式的一个简单证明

利用数学归纳法和函数的单调性，本给出了Alzer不等式的一个简单证明．     

The joint embedding property in normal open induction

The models of normal open induction are those discretely ordered rings, integrally closed in their fraction field whose nonnegative part satisfy Peano's induction axioms for open formulas in the language of ordered semirings.

It is known that neither open induction nor the usually studied stronger fragments of arithmetic (where induction for quantified formulas is allowed), have the joint embedding property.

We prove that normal models of open induction have the joint embedding property.     

Independence of inadmissible strategies and best reply stability: a direct proof

Hillas (1990) introduced a definition of strategic stability based on perturbations of the best reply correspondence that satisfies all of the requirements given by Kohlberg and Mertens (1986). Hillas et al. (2001) point out though that the proofs of the iterated dominance and forward induction properties were not correct. They also provide a proof of the IIS property, a stronger version of both iterated dominance and forward induction, using the results of that paper. In this note we provide a direct proof of the IIS property.Received February 2002     

Parabolic Induction and the Bernstein Decomposition

We use some fundamental work of Bernstein to study parabolic induction in reductive p-adic groups. In particular, we determine when parabolic induction from a component of the Bernstein decomposition of a Levi subgroup to the corresponding component of the full group is an equivalence of categories.