Math 2.0

Concept

Alpha recursion theory

Summary

In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals α\alpha. An admissible set is closed under Σ1(Lα)\Sigma_1(L_\alpha) functions, where LξL_\xi denotes a rank of Godel's constructible hierarchy. α\alpha is an admissible ordinal if LαL_{\alpha} is a model of Kripke–Platek set theory. In what follows α\alpha is considered to be fixed.

Further reading

  1. Wikipedia, page 12008116, revision 1345548712, Alpha recursion theory. adopted
About this page
TagTF9NV9Z8N3
URIm2://TF9NV9Z8N3
Aliasesalpha-recursion, recursion-theory
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.