Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Andreas Weierman"'
Autor:
Gunnar Wilken, Andreas Weiermann
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of natural numb
Externí odkaz:
https://doaj.org/article/f4070cb0bec1453db8560f40fbbe8560
Autor:
Andreas Weiermann
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
The aim of this paper is threefold: firstly, to explain a certain segment of ordinals in terms which are familiar to the analytic combinatorics community, secondly to state a great many of associated problems on resulting count functions and thirdly,
Externí odkaz:
https://doaj.org/article/f983f3ce048e46a6b91a2edb82e7160e
Autor:
Andreas Weiermann
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 1 (2003)
The Ackermann function is a fascinating and well studied paradigm for a function which eventually dominates all primitive recursive functions. By a classical result from the theory of recursive functions it is known that the Ackermann function can be
Externí odkaz:
https://doaj.org/article/62ad8efe690f4761a39710c29997b010
Autor:
David FernÁndez-Duque, Joost J Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weierman
Japaridze's provability logic $GLP$ has one modality $[n]$ for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic $(PA)$ and related theories. Among other benefits, this analysis yields the so-calle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa50cb1ad46d4d391d126744c327522c
