well-ordering theorem

New algorithm for machine vision navigation of farm machine based on well-ordered set and crop row structure;

基于良序集和垄行结构的农机视觉导航参数提取算法

In term of the characteristics of both fair exchange protocols and strand spaces, this paper defines two new notions: bundle s maximum node and well-ordered bundle.

本文根据公平交换协议和串空间的特点,定义了丛最大(极大)结点、良序丛的概念。

Eigenvalue matrix for resolving sparse polynomial equations is constructed by deploying well arranged basis in semigroup algebra k[A].

本文利用半群代数k[A]中良序基,构造了求稀疏多项式方程组解的特征值矩阵,并给出了可以构造方阵的条件。

In this paper, we discuss how to construct well arranged basis for idea F A in semigroup Algebra by means of Gauss-Jordan elimination,moreover,get well-behaved basis-groebner basis.

讨论了在半群代数k[A]中 ,如何利用Gause -Jordan消元法去构造半群代数的理想的良序基 ,进而得到理想的良性基 -Groebner -基 。

One of them deals detailedly with the logical relation between the principle of mathematical induction (type I sa well as type I )and the well-ordering principle under a certain condition and the other introduces an axiom concerning the natural numbers and demonstrates the equivalence between it and the system of Peano axioms.

其一详论在一定条件下,Ⅰ、Ⅱ型数学归纳原理及良序原理之间的逻辑关系:另一则提供一个关于自然数集N的公理并论证它与Peano公理系统的等价性。