Residence United States Nationality India, United States | Name Rohit Parikh | |
Born November 20, 1936 (age 87)
Palanpur, British India (now Gujarat, India) ( 1936-11-20 ) Institutions City University of New York Alma mater Harvard University, PhD Mathematics, 1962; Harvard College, AB with highest honors in Physics, 1957 Doctoral students Former: Horacio Arlo-Costa, Can Baskent, Alessandra Carbone, Samir Chopra, David Ellerman, Amy Greenwald, Pawel Krasucki, Gilbert Ndjatou, Eric Pacuit, Laxmi Parida, Shlomit Pinter, R. Ramanujam, Samer Salame, Farishta Satari, Thomas Sibley, Rick Statman, Chris Steinsvold, Maria Weiss, Ruili Ye, Mark Zelcer, Loes Olde Loohuis.
Current: Yunqi Xue, Todd Stambaugh, Jongjin Kim. Known for his work in recursion theory, proof theory, non-standard analysis, ultrafinitism, dynamic logic, logic of knowledge, philosophical logic, social software, Parikh's theorem. Education Harvard College, Harvard University Fields Mathematical logic, Philosophy, Computer Science, Economics Doctoral advisor Hartley Rogers, Jr., Burton Dreben |
Rohit Jivanlal Parikh (born November 20, 1936) is a mathematician, logician, and philosopher who has worked in many areas in traditional logic, including recursion theory and proof theory. His catholic attitude towards logic has led to work on topics like vagueness, ultrafinitism, belief revision, logic of knowledge, game theory and social software (social procedure). This last area seeks to combine techniques from logic, computer science (especially logic of programs) and game theory to understand the structure of social algorithms. Examples of such are elections, transport systems, lectures, conferences, and monetary systems, all of which have properties of interest to those who are logically inclined.
Contents
Rohit Parikh was married from 1968 to 1994 to Carol Parikh (née Geris), who is best known for her prize-winning stories and for her influential biography of Oscar Zariski, The Unreal Life of Oscar Zariski. They have two children, Vikram (born 1969) and Uma (born 1974).
Parikh's theorem, stating that regular languages and context-free languages have the same sets of letter frequency vectors, is named after him. Among his other contributions is the introduction of bounded arithmetic and the logic of games.