Dana Scott
E207979
Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Dana Scott canonical | 9 |
How this entity was disambiguated
This entity first appeared as the object of triple T1861745 — 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.
Target entity: Dana Scott Context triple: [Alonzo Church, influenced, Dana Scott]
-
A.
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.
-
B.
Solomon Feferman
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
-
C.
Stephen Kleene
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.
-
D.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Dana Scott Target entity description: Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
-
A.
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.
-
B.
Solomon Feferman
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
-
C.
Stephen Kleene
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.
-
D.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
E.
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.
- F. None of above. chosen
Statements (53)
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.
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.
Subject: Dana Scott Description of subject: Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
Referenced by (9)
Full triples — surface form annotated when it differs from this entity's canonical label.