Konstruktion nichtrekursiver Funktionen

  title={Konstruktion nichtrekursiver Funktionen},
  author={Rozsa Peter},
  journal={Mathematische Annalen},
  • R. Peter
  • Published 1 December 1935
  • Mathematics
  • Mathematische Annalen
Recursive Functions (Stanford Encyclopedia of Philosophy)
Such a definition might at first appear circular in virtue of the fact that the value of fact(x) on the left hand side is defined in terms the same function on the righthand side. However a
LPO Proofs in Two Educational Contexts
It turns out that there is no clear winner in both contexts, but the newly introduced so-called shuffled Fitch style is the most practical choice.
A functional proof pearl: inverting the Ackermann hierarchy
This work implements in Gallina a hierarchy of functions that calculate the upper inverses to the hyperoperation/Ackermann hierarchy and shows that these functions are consistent with the usual definition of the inverse Ackermann function α(n).
History of Informatics. From recursivity to the Turing universal machine and Horn clauses
The article describes the contribution of Romanian scientists in several fields of scientific research, on the fundamentals of calculus theory, the fundamentals of cybernetics, the algebra theory of
Computational Multiscale Modeling of Fluids and Solids
mathematical notation of set theory and functions on sets are helpful but not essential. This notation is introduced and explained in Part I of this book, particularly in Chap. 3. The same holds for
Turing, Gödel and the “Bright Abyss”
We consider the development of computability in the 1930s from what we have called the formalism free point of view. We employ a dual conceptual framework: confluence together with grounding.
Recursion-Theoretic Hierarchies
Advanced Control Flow
This chapter reviews basic control flow and then presents advanced control flow, which is not easily simulated using the basic control structures.
Two-dimensional modal logics with difference relations
The notion of products of propositional modal logics, introduced by Segerberg [35] and Shehtman [36], provides a conceptually appealing approach to combining modallogics.


Über das Unendliche
Zum Hilbertschen Aufbau der reellen Zahlen
Um den Beweis fiir die yon Cantor aufgestellte Vermutung zu e~bringen, dal~ sich die Menge der ree|len Zahlen, d. h. der zaMentheoretischen I~unktionen, mi~ Hilfe der Zahlen de~ zweiten Zahlklasse