Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,550 papers from all fields of science
Search
Sign In
Create Free Account
Transfinite induction
Known as:
Transfinite iteration
, Induction
, Well-ordered induction
Expand
Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers. Let…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Bar induction
Bar recursion
De Bruijn–Erdős theorem (graph theory)
Epsilon-induction
Expand
Broader (1)
Recursion
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
High Energy Physics and Cosmology as Computation
M. Naschie
2016
Corpus ID: 124364436
The present paper is basically written as a non-apologetic strong defence of the thesis that computation is part and parcel of a…
Expand
2014
2014
On a New Elementary Particle from the Disintegration of the Symplectic 't Hooft-Veltman-Wilson Fractal Spacetime
M. Naschie
2014
Corpus ID: 9429266
't Hooft-Veltman Wilson dimensional regularization depends crucially upon Borel summability which entails strong links to the…
Expand
2008
2008
String theory, exceptional Lie groups hierarchy and the structural constant of the universe
M. Naschie
2008
Corpus ID: 58895689
2004
2004
Transfinite Electrical Networks, Spinoral Varieties and Gravity Q Bits
M. Naschie
2004
Corpus ID: 120488733
1999
1999
Transfinite order dimension
F. G. Arenas
,
M. L. Puertas
1999
Corpus ID: 118744103
1993
1993
On the Concentration of Infinite Traces
V. Diekert
Theoretical Computer Science
1993
Corpus ID: 44684834
1979
1979
CONSTRUCTIVE VERSIONS OF TARSKΓS FIXED POINT THEOREMS
P. Cousot
,
R. Cousot
1979
Corpus ID: 18597496
Let F be a monotone operator on the complete lattice L into itself. Tarski's lattice theoretical fixed point theorem states that…
Expand
1972
1972
Describing ordinals using functionals of transfinite type
P. Aczel
Journal of Symbolic Logic (JSL)
1972
Corpus ID: 6166737
Bachmann, in [2] shows how certain ordinals <Ω(Ω = Ω1 where Ωξ is the (1 + ξ)th infinite initial ordinal) may be described from…
Expand
1940
1940
Nilpotent groups and their generalizations
R. Baer
1940
Corpus ID: 54038611
Nilpotent finite groups may be defined by a great number of properties. Of these the following three may be mentioned, since they…
Expand
1935
1935
Approximation by polynomials in the complex domain
J. Walsh
1935
Corpus ID: 55901334
© Gauthier-Villars, 1935, tous droits réservés. L’accès aux archives de la collection « Mémorial des sciences mathématiques…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE