Alpha recursion theory: Difference between revisions

Revision as of 14:59, 21 October 2021

Revision as of 20:13, 22 October 2021

Line 6:

*Members of <math>L_\alpha</math> are called '''<math>\alpha</math>-finite''' and play a similar role to the finite numbers in classical recursion theory.

There are also some similar definitions for functions mapping <math>\alpha</math> to <math>\alpha</math>.<ref>Srebrny, Marian, [httpshttp://matwbn.icm.edu.pl/ksiazki/fm/fm96/fm96114.pdf Relatively constructible transitive models] (p.165). Accessed 21 October 2021.</ref>

We say R is a reduction procedure if it is <math>\alpha</math> recursively enumerable and every member of R is of the form <math> \langle H,J,K \rangle </math> where ''H'', ''J'', ''K'' are all α-finite.