b. 1947
Daniel Leivant is a contemporary logician and computer scientist known for his work in proof theory, computational complexity, and the foundations of mathematics. His research explores the intersection of logic and computation, particularly how formal systems relate to computational resources and feasibility.
Contributions to implicit computational complexity via ramified recursion
Research on the proof theory of intuitionistic and classical logic
Work on type systems and polymorphic lambda calculus
Studies on the relationship between logical formalisms and computational feasibility
Faculty appointment at Indiana University Bloomington in computer science and logic