Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Ronald Fagin

Also Known As Ron Fagin
Information Systems

Ronald Fagin (born 1945, in Oklahoma City) is an American mathematician and computer scientist who is an IBM Fellow at IBM Research in Silicon Valley. He is known for Fagin's theorem, a foundational result in descriptive complexity theory showing that existential second-order logic captures the complexity class NP, and for influential work on database normal forms, including fourth and fifth normal form and domain-key normal form, as well as on reasoning about knowledge. He earned his PhD in mathematics from the University of California, Berkeley, in 1973 under Robert Vaught and joined IBM Research that year. He received the SIGMOD Edgar F. Codd Innovations Award in 2004, the IEEE W. Wallace McDowell Award in 2012, and the Godel Prize in 2014.

Facts
Birth Year
1945 1
Birth Date
1945-05-01 1
Award
SIGMOD Edgar F. Codd Innovations Award 1
Award
IEEE Fellow 1
Award
Alonzo Church Award 1
Award
Gödel Prize 1
Award
ACM Fellow 1
Award
W. Wallace McDowell Award 1
Award
honorary doctor of Paris Dauphine University 1
Award
IBM Fellow 1
Award
Fellow of the American Association for the Advancement of Science 1
Sources
1. Wikidata: Ronald Fagin
  • Wikidata Q93124, class allow-list match (w-wdresolver-0926)
  • In Group: Data Management Systems
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.