Recursive Functions and Intuitionistic Mathematics
E601583
Recursive Functions and Intuitionistic Mathematics is a seminal work by Stephen Kleene that develops the theory of recursive (computable) functions within the framework of intuitionistic logic and mathematics.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Recursive Functions and Intuitionistic Mathematics canonical | 1 |
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
logic textbook
ⓘ
mathematics book ⓘ |
| aim | to develop the theory of recursive functions within intuitionistic mathematics ⓘ |
| author |
Stephen C. Kleene
NERFINISHED
ⓘ
Stephen Cole Kleene NERFINISHED ⓘ |
| contribution |
formal treatment of constructive reasoning about recursive functions
ⓘ
integration of computability theory with intuitionistic logic ⓘ systematic development of recursion theory in an intuitionistic setting ⓘ |
| field |
constructive mathematics
ⓘ
intuitionistic mathematics ⓘ mathematical logic ⓘ recursion theory ⓘ |
| framework |
intuitionistic logic
ⓘ
intuitionistic mathematics ⓘ |
| hasConcept |
Turing computability
NERFINISHED
ⓘ
constructive existence proof ⓘ formal system for intuitionistic arithmetic ⓘ intuitionistic proof ⓘ lambda-definable function ⓘ partial recursive function ⓘ |
| influencedBy |
Alan Turing
NERFINISHED
ⓘ
Alonzo Church NERFINISHED ⓘ Arend Heyting NERFINISHED ⓘ Kurt Gödel NERFINISHED ⓘ L. E. J. Brouwer NERFINISHED ⓘ |
| language | English ⓘ |
| notableFor |
being a seminal work in recursion theory
ⓘ
clarifying the role of recursive functions in intuitionistic frameworks ⓘ influencing later work in constructive and intuitionistic mathematics ⓘ |
| relatedTo |
Foundations of Intuitionistic Mathematics
NERFINISHED
ⓘ
Introduction to Metamathematics NERFINISHED ⓘ Theory of recursive functions and effective computability NERFINISHED ⓘ |
| subject |
Church–Turing thesis
NERFINISHED
ⓘ
arithmetical hierarchy ⓘ computable functions ⓘ constructive proof theory ⓘ formal systems ⓘ formalization of computation ⓘ intuitionistic logic ⓘ intuitionistic number theory ⓘ lambda-definability ⓘ partial recursive functions ⓘ primitive recursive functions ⓘ realizability ⓘ recursive functions ⓘ total recursive functions ⓘ |
| topic |
foundations of constructive arithmetic
ⓘ
relationship between computability and constructive logic ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.