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… 
2007
2007
The intention of this talk is to look at various models of transfinite computation and give some calculations as to their… 
1972
1972
Bachmann, in [2] shows how certain ordinals <Ω(Ω = Ω1 where Ωξ is the (1 + ξ)th infinite initial ordinal) may be described from… 
1962
1962
THE steady-state cosmological theory of Bondi, Gold, and Hoyle implies that the number of atoms in the universe is infinite to an… 
1940
1940
Nilpotent finite groups may be defined by a great number of properties. Of these the following three may be mentioned, since they…