Modeling erratic curves with non-recursive functions

2021 ◽  
Vol 15 (13) ◽  
pp. 657-665
Author(s):  
Jelloul Elmesbahi
Keyword(s):  
Recursive Functions

Preliminaries

2017 ◽  
Author(s):  
David J. Lobina
Keyword(s):  
Data Structures ◽  
Production Systems ◽  
Specific Data ◽  
Recursive Functions ◽  
Recursive Solution ◽  
Partial Recursive Functions ◽  
Recursive Structures ◽  
Recursive Data Structures ◽  
Recursive Data ◽  
The Relationship

Recursion, or the capacity of ‘self-reference’, has played a central role within mathematical approaches to understanding the nature of computation, from the general recursive functions of Alonzo Church to the partial recursive functions of Stephen C. Kleene and the production systems of Emil Post. Recursion has also played a significant role in the analysis and running of certain computational processes within computer science (viz., those with self-calls and deferred operations). Yet the relationship between the mathematical and computer versions of recursion is subtle and intricate. A recursively specified algorithm, for example, may well proceed iteratively if time and space constraints permit; but the nature of specific data structures—viz., recursive data structures—will also return a recursive solution as the most optimal process. In other words, the correspondence between recursive structures and recursive processes is not automatic; it needs to be demonstrated on a case-by-case basis.

Algorithmic Logic with Recursive Functions

1981 ◽  
Vol 4 (4) ◽  
pp. 975-995
Author(s):  
Andrzej Szałas
Keyword(s):  
Completeness Theorem ◽  
Inference Rules ◽  
Partial Correctness ◽  
Recursive Functions ◽  
Algorithmic Logic ◽  
Block Structured

A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.

Transcendence of cardinals

1965 ◽  
Vol 30 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Gaisi Takeuti
Keyword(s):  
Set Theory ◽  
Natural Numbers ◽  
Recursive Functions ◽  
Power Set ◽  
Recursive Predicate

In this paper, by a function of ordinals we understand a function which is defined for all ordinals and each of whose value is an ordinal. In [7] (also cf. [8] or [9]) we defined recursive functions and predicates of ordinals, following Kleene's definition on natural numbers. A predicate will be called arithmetical, if it is obtained from a recursive predicate by prefixing a sequence of alternating quantifiers. A function will be called arithmetical, if its representing predicate is arithmetical.The cardinals are identified with those ordinals a which have larger power than all smaller ordinals than a. For any given ordinal a, we denote by the cardinal of a and by 2a the cardinal which is of the same power as the power set of a. Let χ be the function such that χ(a) is the least cardinal which is greater than a.Now there are functions of ordinals such that they are easily defined in set theory, but it seems impossible to define them as arithmetical ones; χ is such a function. If we define χ in making use of only the language on ordinals, it seems necessary to use the notion of all the functions from ordinals, e.g., as in [6].

A Buchholz derivation system for the ordinal analysis of KP + Π3-reflection

2006 ◽  
Vol 71 (4) ◽  
pp. 1237-1283
Author(s):  
Markus Michelbrink
Keyword(s):  
Ordinal Analysis ◽  
Notation System ◽  
Recursive Functions ◽  
Conservation Result ◽  
Ordinal Notation

AbstractIn this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π3-Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP + Π3-Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS∞-derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP + Π3-Reflection as <-recursive functions where < is the ordering on Rathjen's ordinal notation system . Further we show a conservation result for -sentences.

A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions

1981 ◽  
Vol 46 (2) ◽  
pp. 216-232 ◽  
Author(s):  
Robert A. di Paola
Keyword(s):  
Recursive Functions ◽  
Admissible Ordinals

AbstractR. M. Friedberg demonstrated the existence of a recursive functional that agrees with no Banach-Mazur functional on the class of recursive functions. In this paper Friedberg's result is generalized to both α-recursive functionals and weak α-recursive functionals for all admissible ordinals α such that λ < α*, where α* is the Σ1-projectum of α and λ is the Σ2-cofinality of α. The theorem is also established for the metarecursive case, α = ω1, where α* = λ = ω.

Sign in / Sign up

Export Citation Format

Share Document