The theory of recursive functions, approaching its centennial
From MaRDI portal
Publication:3946156
DOI10.1090/S0273-0979-1981-14920-XzbMath0486.03023MaRDI QIDQ3946156
Publication date: 1981
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
History of mathematics in the 20th century (01A60) Philosophical and critical aspects of logic and foundations (03A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Related Items
The Mathematical Work of S.C.Kleene ⋮ Computability and Recursion ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Closure functions and general iterates as reflectors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A set of postulates for the foundation of logic
- A set of postulates for the foundation of logic. II
- Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion
- Konstruktion nichtrekursiver Funktionen
- General recursive functions of natural numbers
- \(\lambda\)-definability and recursiveness
- Über die mehrfache Rekursion
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursive Functionals and Quantifiers of Finite Types I
- The theory of algorithms
- Theory of Formal Systems. (AM-47)
- Comparison of Russell's resolution of the semantical antinomies with that of Tarski
- Recursive Unsolvability of a problem of Thue
- Recursive Functionals and Quantifiers of Finite Types II
- An Unsolvable Problem of Elementary Number Theory
- Recursive Predicates and Quantifiers
- Formal Reductions of the General Combinatorial Decision Problem
- Recursively enumerable sets of positive integers and their decision problems
