PA degree
In the mathematical field of computability theory, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed-point-free (DNR) functions, and have been thoroughly investigated in recursion theory.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
PA degree
In the mathematical field of computability theory, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed-point-free (DNR) functions, and have been thoroughly investigated in recursion theory.
has abstract
In the mathematical field of c ...... estigated in recursion theory.
@en
Wikipage page ID
22,822,116
page length (characters) of wiki page
Wikipage revision ID
988,117,466
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In the mathematical field of c ...... estigated in recursion theory.
@en
label
PA degree
@en