On the public citation graph
The Mathematical Work of S.C.Kleene
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1007/bfb0066770openalex-snapshot
Cambridge Summer School in Mathematical Logic
inferredcites →https://doi.org/10.1007/bfb0066772openalex-snapshot
Realizability: A retrospective survey
inferredcites →https://doi.org/10.1007/bfb0098600openalex-snapshot
Recursion on the Countable Functionals
inferredcites →https://doi.org/10.1016/s0049-237x(08)70933-9openalex-snapshot
Recursive Functionals and Quantifiers of Finite Types Revisited I
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7045-4openalex-snapshot
Generalized Recursion Theory II - Proceedings of the 1977 Oslo Symposium
inferredcites →https://doi.org/10.1016/s1385-7258(56)50037-6openalex-snapshot
A Note on Computable Functionals
inferredcites →https://doi.org/10.1080/00029890.1939.11990907openalex-snapshot
A Postulational Basis for Probability
inferredcites →https://doi.org/10.1090/memo/0089openalex-snapshot
Formalized recursive functionals and formalized realizability
inferredcites →https://doi.org/10.1090/pspum/005/0141594openalex-snapshot
Herbrand-Gödel-style recursive functionals of finite types
inferredcites →https://doi.org/10.1090/pspum/042/791054openalex-snapshot
Unimonotone functions of finite types (Recursive functionals and quantifiers of finite types revisited IV)
inferredcites →https://doi.org/10.1090/s0002-9904-1936-06353-6openalex-snapshot
A note on recursive functions
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9904-1955-09896-3openalex-snapshot
Hierarchies of number-theoretic predicates
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1957-0091243-2openalex-snapshot
A Note on Function Quantification
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1090/s0002-9947-1947-0025420-1openalex-snapshot
Recursive Functions and Intuitionistic Number Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0684494-7openalex-snapshot
Syntax and Semantics in Higher-Type Recursion Theory
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14920-xopenalex-snapshot
The theory of recursive functions, approaching its centennial
inferredcites →https://doi.org/10.1109/jrproc.1947.231927openalex-snapshot
Analysis of Lengthening of Modulated Repetitive Pulses
inferredcites →https://doi.org/10.1109/mahc.1981.10004openalex-snapshot
Origins of Recursive Function Theory
inferredcites →https://doi.org/10.1112/plms/s3-12.1.245openalex-snapshot
Turing-Machine Computable Functionals of Finite Types II†
inferredcites →https://doi.org/10.1215/s0012-7094-36-00227-2openalex-snapshot
λ-definability and recursiveness
inferredcites →https://doi.org/10.1305/ndjfl/1093637645openalex-snapshot
Reflections on Church's thesis.
inferredcites →https://doi.org/10.2307/1968646openalex-snapshot
The Inconsistency of Certain Formal Logics
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2269016openalex-snapshot
On the interpretation of intuitionistic number theory
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
inferredcites →https://doi.org/10.2307/2371199openalex-snapshot
A Theory of Positive Integers in Formal Logic. Part II
inferredcites →https://doi.org/10.2307/2371894openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals
inferredcites →https://doi.org/10.2307/2372632openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
inferredcites →https://doi.org/10.2307/2963675openalex-snapshot
Disjunction and existence under implication in elementary intuitionistic formalisms
inferredcites →https://doi.org/10.4064/cm-6-1-67-78openalex-snapshot
Extension of an effectively generated class of functions by enumeration
inferredcites →https://doi.org/10.4064/fm-46-2-123-135openalex-snapshot
Separation principles in the hierarchies of classical and effective descriptive set theory
inferredcites →https://doi.org/10.4064/fm-50-3-281-303openalex-snapshot
Lambda-definable functionals of finite types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-41375-9_6openalex-snapshot
Computation as Information Processing
inferred← citeshttps://doi.org/10.1007/978-94-015-8988-8_9openalex-snapshot
A Picaresque Approach to Set Theory Genealogy
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_12openalex-snapshot
Computability and Enumerability
inferred← citeshttps://doi.org/10.1007/s00224-009-9182-xopenalex-snapshot
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.008openalex-snapshot
Turing oracle machines, online computing, and three displacements in computability theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80017-2openalex-snapshot
The History and Concept of Computability
inferred← citeshttps://doi.org/10.1080/01445340.2013.816555openalex-snapshot
Completeness: from Gödel to Henkin
inferred← citeshttps://doi.org/10.1080/0144534042000271157openalex-snapshot
Diagonalisation and Church's Thesis: Kleene's Homework
inferred← citeshttps://doi.org/10.1080/01445349708837290openalex-snapshot
Alonzo church:his life, his work and some of his miracles
inferred← citeshttps://doi.org/10.1093/jigpal/jzl006openalex-snapshot
Naming and Diagonalization, from Cantor to Godel to Kleene
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.