Stephen Kleene
E148433
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Stephen Cole Kleene | 23 |
| Stephen Kleene canonical | 8 |
| Stephen C. Kleene | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1255230 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stephen Kleene Context triple: [Church–Turing thesis, associatedWith, Stephen Kleene]
-
A.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
B.
John von Neumann
John von Neumann was a pioneering 20th-century mathematician and polymath whose foundational work in game theory, computer science, quantum mechanics, and economics profoundly shaped modern science and technology.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Stephen Kleene Target entity description: Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
-
A.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
B.
John von Neumann
John von Neumann was a pioneering 20th-century mathematician and polymath whose foundational work in game theory, computer science, quantum mechanics, and economics profoundly shaped modern science and technology.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
American logician
ⓘ
American mathematician ⓘ human ⓘ logician ⓘ mathematician ⓘ |
| academicAdvisor | Alonzo Church ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| educatedAt |
Amherst College
ⓘ
Princeton University ⓘ |
| employer | University of Wisconsin–Madison ⓘ |
| familyName | Kleene ⓘ |
| fieldOfWork |
computer science
ⓘ
foundations of mathematics ⓘ mathematical logic ⓘ recursion theory ⓘ theory of computation ⓘ |
| gender | male ⓘ |
| givenName | Stephen ⓘ |
| influenced |
automata theory
ⓘ
formal language theory ⓘ
linked to:
Chomsky hierarchy
the development of theoretical computer science ⓘ the formal theory of computation ⓘ |
| knownFor |
Kleene algebra
ⓘ
Kleene hierarchy ⓘ Kleene star ⓘ Kleene’s normal form theorem ⓘ Kleene’s recursion theorem ⓘ
linked to:
Kleene numbering
contributions to intuitionistic logic ⓘ formalization of computability ⓘ foundational work in recursion theory ⓘ introduction of regular expressions in logic and computation ⓘ work on partial recursive functions ⓘ |
| language | English ⓘ |
| middleName | Cole ⓘ |
| name |
Stephen Cole Kleene
ⓘ
linked to:
Stephen Kleene
|
| notableConcept |
Kleene algebra
ⓘ
Kleene hierarchy ⓘ Kleene star ⓘ Kleene’s normal form theorem ⓘ Kleene’s recursion theorem ⓘ partial recursive functions ⓘ |
| notableWork |
Introduction to Metamathematics
ⓘ
Recursive Functions and Intuitionistic Mathematics ⓘ |
| occupation |
researcher
ⓘ
university professor ⓘ |
| studentOf | Alonzo Church ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Stephen Kleene Description of subject: Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
Referenced by (32)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
subject linked to:
Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene
linked to: Stephen Kleene