Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logique mathematique --- Fonctions recursives

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logique mathematique --- Fonctions recursives --- Systemes formels

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logique mathématique --- Récursivité, Théorie de la --- Logique mathematique --- Fonctions recursives

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers. This theory is somewhat special, for to some extent it can be reduced to first order theory, but when properly extended and relativized it requires the full machinery of higher order computations. In the theory of recursive monotonic function

Fonctions recursive --- Recursieve functies --- Recursive functions --- Fonctions récursives. --- Recursive functions. --- Fonctions récursives --- Functions, Recursive --- Algorithms --- Arithmetic --- Logic, Symbolic and mathematical --- Number theory --- Recursion theory --- Decidability (Mathematical logic) --- Foundations --- Functional analysis. --- Functional calculus --- Calculus of variations --- Functional equations --- Integral equations

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logique mathématique --- Récursivité, Théorie de la --- Décidabilité (logique mathématique) --- Logique mathematique --- Calculabilite --- Fonctions recursives