Rohit Jivanlal Parikh
Indian-American mathematician
From Wikipedia, the free encyclopedia
Rohit Jivanlal Parikh is an Indian-American mathematician, logician, computer scientist and philosopher known for his contributions to mathematical logic, recursion theory, proof theory, epistemic logic, game theory, formal languages, and social software.[3][4] He has been a Distinguished Professor at Brooklyn College at the City University of New York (CUNY) (1982-2023).[5]
Rohit Jivanlal Parikh | |
|---|---|
Parikh in 2004 | |
| Alma mater | Harvard University, PhD Mathematics, 1962; Harvard College, AB with highest honors in Physics, 1957 |
| Known for | Work on recursion theory, proof theory, non-standard analysis, ultrafinitism, dynamic logic, logic of knowledge, philosophical logic, social software, Parikh's theorem |
| Spouse | Carol Parikh |
| Children | Two (Vikram and Uma) |
| Awards | William Lowell Putnam Mathematical Competition Prize Winner, 1955, 1956, 1957;[1] William Lowell Putnam Fellow 1957;[2] |
| Scientific career | |
| Fields | Mathematics, logic, philosophy, computer sciences, economics |
| Institutions | Brooklyn College CUNY Graduate Center |
| Doctoral advisor | Hartley Rogers, Jr Burton Dreben |
| Doctoral students | |
Early life and education
He completed his undergraduate studies at Harvard College, graduating magna cum laude with honors in physics in 1957.[6] He earned his Ph.D. in mathematics from Harvard University in 1962 under the supervision of Hartley Rogers Jr and Burton Dreben.[3]
Parikh was selected as a Fellow of Harvard University.[3]
Academic career
Parikh served on the faculty of Boston University from 1967 to 1982 before joining the City University of New York (CUNY), where he was appointed Distinguished Professor in 1982. He held this title until 2023.[7]
Parikh has been affiliated with the fields of computer science, mathematics, and philosophy. Earlier in his career he taught at Panjab University in India during 1964–1965.[citation needed] His academic appointments include visiting and research positions at Stanford University, Massachusetts Institute of Technology (MIT) Laboratory for Computer Science, Courant Institute of Mathematical Sciences at New York University, ETH Zurich, Tata Institute of Fundamental Research, SUNY Buffalo, Panjab University, and Bristol University.[citation needed]
Parikh is also one of the founders of the Indian Conference on Logic and Applications (ICLA).[8]
Research
Parikh’s early work made contributions to recursion theory, proof theory, and formal languages.[7] He is particularly known in theoretical computer science for work related to Parikh’s theorem, which concerns the commutative image of context-free languages and their semi-linear sets.[9] His interests expanded over time to include non-standard analysis, logic of programs, epistemic logic (logic of knowledge), belief revision, and game theory.[10] Parikh is also recognized for advancing the interdisciplinary field of “social software,” which applies logical, computational, and game-theoretic techniques to analyze social procedures and algorithms such as elections, communication protocols, and decision-making systems.[10][11]
Personal life and politics
Rohit Parikh was married from 1968 to 1994 to Carol Parikh (née Geris), who is best known for her stories and biography of Oscar Zariski, The Unreal Life of Oscar Zariski.[citation needed]
Parikh is a nontheist opposing abortions. To fight abortions he joined the Atheist and Agnostic Pro-Life League.[12]
Awards and recognition
- Gibbs Prize, Bombay University, 1954[3]
- William Lowell Putnam Mathematical Competition Prize Winner, 1955,[13] 1956,[14] 1957[1]
Publications
- Existence and Feasibility in Arithmetic, Journal of Symbolic Logic 36 (1971) pages 494–508.
- On the Length of Proofs, Transactions of the American Mathematical Society 177 (1973) pages 29–36.
- (With M. Parnes) Conditional Probability can be Defined for Arbitrary Pairs of Sets of Reals, Advances in Mathematics 9 (1972) pages 520–522.
- (With D.H.J. de Jongh) Well Partial Orderings and Hierarchies, Proc. Kon. Ned. Akad. Sci Series A 80 (1977) pages 195–207.
- (With D. Kozen) An Elementary Completeness Proof for PDL Theoretical Computer Science 14 (1981) pages 113–118.
- The Problem of Vague Predicates, in Logic, Language and Method Ed. Cohen and Wartofsky, Reidel (1982) pages 241–261.
- Parikh, Rohit J. "On context-free languages." Journal of the ACM (JACM) 13.4 (1966): 570-581.