Skip to search formSkip to main contentSkip to account menu

Transfinite induction

Known as: Transfinite iteration, Induction, Well-ordered induction 
Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers. Let… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The present paper is basically written as a non-apologetic strong defence of the thesis that computation is part and parcel of a… 
2014
2014
't Hooft-Veltman Wilson dimensional regularization depends crucially upon Borel summability which entails strong links to the… 
2011
2011
We study the asymptotic equidistribution of points with discrete energy close to Robin’s constant of a compact set in the plane… 
Highly Cited
1984
Highly Cited
1984
In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in… 
1979
1979
Let F be a monotone operator on the complete lattice L into itself. Tarski's lattice theoretical fixed point theorem states that… 
1940
1940
Nilpotent finite groups may be defined by a great number of properties. Of these the following three may be mentioned, since they… 
1935
1935
© Gauthier-Villars, 1935, tous droits réservés. L’accès aux archives de la collection « Mémorial des sciences mathématiques…