Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Stan S. Wainer"'
Autor:
Stan S. Wainer, Geoffrey E. Ostrin
Publikováno v:
New Computational Paradigms ISBN: 9783540261797
CiE
CiE
Complexity classes between Grzegorczyk's E2 and E3 are characterized in terms of provable recursion in a theory EA(I;O) formalising basic principles of Nelson's Predicative Arithmetic. Extensions by inductive definitions enable full arithmetic PA and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abfa09463a2955b02b593b3fbf3d6d49
https://doi.org/10.1007/11494645_47
https://doi.org/10.1007/11494645_47