Alpha recursion theory

In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals α {\displaystyle \alpha } . An admissible set is closed under Σ 1 ( L α ) {\displaystyle \Sigma _{1}(L_{\alpha })} functions, where L ξ {\displaystyle L_{\xi }} denotes a rank of Godel's constructible hierarchy.

Source: Wikipedia — Alpha recursion theory (CC BY-SA 4.0)

Alpha recursion theory

In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals α {\displaystyle \alpha } . An admissible set is closed under Σ 1 ( L α ) {\displaystyle \Sigma _{1}(L_{\alpha })} functions, where L ξ {\displaystyle L_{\xi }} denotes a rank of Godel's constructible hierarchy.

This neuron ends here.

Source: Wikipedia "Alpha recursion theory" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy