Matches in DBpedia 2014 for { <http://dbpedia.org/resource/PA_degree> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- PA_degree abstract "In recursion theory, a mathematical discipline, 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.".
- PA_degree wikiPageID "22822116".
- PA_degree wikiPageRevisionID "552781372".
- PA_degree hasPhotoCollection PA_degree.
- PA_degree subject Category:Computability_theory.
- PA_degree comment "In recursion theory, a mathematical discipline, 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.".
- PA_degree label "PA degree".
- PA_degree sameAs m.063zdhz.
- PA_degree sameAs Q7118319.
- PA_degree sameAs Q7118319.
- PA_degree wasDerivedFrom PA_degree?oldid=552781372.
- PA_degree isPrimaryTopicOf PA_degree.