The Mathematical Work of S.C.Kleene
From MaRDI portal
Publication:4837673
DOI10.2307/420945zbMath0829.03003MaRDI QIDQ4837673
Publication date: 3 July 1995
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0101-toc.htm
01A70: Biographies, obituaries, personalia, bibliographies
03-03: History of mathematical logic and foundations
Related Items
Alonzo church:his life, his work and some of his miracles, Completeness: from Gödel to Henkin, Diagonalisation and Church's Thesis: Kleene's Homework, Speed-up theorems in type-2 computations using oracle Turing machines, Turing oracle machines, online computing, and three displacements in computability theory
Cites Work
- Unnamed Item
- On degrees of recursive unsolvability
- Reflections on Church's thesis
- Recursion on the countable functionals
- Proof by cases in formal logic
- The inconsistency of certain formal logics
- General recursive functions of natural numbers
- \(\lambda\)-definability and recursiveness
- The upper semi-lattice of degrees of recursive unsolvability
- Recursive well-orderings
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Disjunction and existence under implication in elementary intuitionistic formalisms
- The theory of recursive functions, approaching its centennial
- The work of Kurt Gödel
- A Theory of Positive Integers in Formal Logic. Part II
- Formalized recursive functionals and formalized realizability
- A note on recursive functions
- Computability and λ-definability
- On notation for ordinal numbers
- A Postulational Basis for Probability
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- On the interpretation of intuitionistic number theory
- Recursively enumerable sets of positive integers and their decision problems