Rohit Jivanlal Parikh

from Wikipedia, the free encyclopedia

Rohit Jivanlal Parikh (born November 20, 1936 in Palanpur , then British India, today in Gujarat , India ) is an Indian-American mathematical logician and computer scientist.

Parikh studied physics and mathematics at Harvard University with a bachelor's degree in 1957 (AB) and 1959 (AM) and a doctorate from Hartley Rogers in 1962 ( Recursive Well Orderings and Transfinite Progressions ). As a student, he successfully participated in the Putnam competition (winners 1955, 1956, 1957) and became a Putnam Fellow in 1957. 1961 to 1963 he was an instructor at Stanford University , 1964/65 reader at Panjab University and 1965 to 1967 lecturer at the University of Bristol . In 1967 he was briefly at Caltech and in the same year became an associate professor at Boston University , where he became professor in 1972. In 1982 he became a Distinguished Professor at CUNY's Brooklyn College .

In 1971/72 he was visiting associate professor at the State University of New York at Buffalo, 1974 visiting professor at Stanford, 1978 visiting scholar at Berkeley, 1979 at the ETH Zurich , 1981 at the Courant Institute and 1977 to 1982 visiting scholar at the Massachusetts Institute of Technology (Lab for Computer Science). In 1971 and 1979 he was at the Tata Institute of Fundamental Research .

Parikh deals with mathematical logic, theory of recursive functions , proof theory , formal languages , non-standard analysis , dynamic logic , ultrafinitism , game theory , logic of knowledge and programs, philosophical logic and philosophy of language, change of opinion (belief revision) and the area of social affairs he established Software , that is, the investigation of social processes using tools from computer science, logic and game theory.

In 1961 he proved Parikh's theorem: Context-free languages have the same frequency distribution of terminal symbols as regular languages . A consequence of the theorem is that some context-free languages ​​must have ambiguous grammars.

With a paper from 1971, he is considered the founder of bounded arithmetic , that is, weakened versions of Peano arithmetic in which, for example, the quantifiers are restricted.

From 2000 to 2003 he was editor of the Journal of Philosophical Logic.

From 1968 to 1994 he was married to Carol Geris, who wrote a biography of Oscar Zariski , among other things .

In connection with the debates over illegal immigration to the United States, he came under public criticism in October 2018 after he had spoken out critical of immigrants from Latin America in a Facebook post.

Fonts (selection)

  • On context free languages, J. of the ACM, Volume 13, 1966, pp. 570-581
  • A nonstandard theory of topological groups, in WAJ Luxemburg (Ed.), Applications of Model Theory, Hold, Rinehart and Winston 1969, pp. 279-284
  • Existence and Feasibility in Arithmetic, Jour. Symbolic Logic, Volume 36, 1971, pp. 494-508.
  • On the Length of Proofs, Transactions of the Amer. Math. Soc., Vol. 177, 1973, pp. 29-36.
  • with M. Parnes: Conditional Probability can be Defined for Arbitrary Pairs of Sets of Reals, Advances in Math. Volume 9, 1972, pp. 520-522.
  • with DHJ de Jongh: Well Partial Orderings and Hierarchies, Proc. Con. Ned. Akad. Sci Series A, Volume 80, 1977, pp. 195-207.
  • with D. Kozen: An Elementary Completeness Proof for PDL, Theoretical Computer Science, Volume 14, 1981, pp. 113-118.
  • The Problem of Vague Predicates, in: Cohen, Wartofsky (Eds.), Logic, Language and Method, Reidel 1982, pp. 241-261.
  • The Logic of Games and its Applications, Annals of Discrete Math., Volume 24 ,. 1985, pp. 111-140.
  • with R. Ramanujam: Distributed Processing and the Logic of Knowledge, in Logics of Programs, Springer Lecture Notes in Computer Science 193, 1990, pp. 256-268.
  • with P. Krasucki: Communication, Consensus and Knowledge, Jour. Economic Theory, Vol. 52, 1990, pp. 178-189.
  • Knowledge and the Problem of Logical Omniscience, ISMIS- 87 (International Symp. On Methodology for Intelligent Systems), North Holland 1987, pp. 432-439.
  • Finite and Infinite Dialogues, in the Proceedings of a Workshop on Logic from Computer Science, Ed. Moschovakis, MSRI publications, Springer 1991 pp. 481-498.
  • Vagueness and Utility: the Semantics of Common Nouns in Linguistics and Philosophy, Volume 17, 1994, pp. 521-535.
  • Topological Reasoning and The Logic of Knowledge (with Dabrowski and Moss) Annals of Pure and Applied Logic 78 (1996) 73-110.
  • Belief revision and language splitting, in: MOss, Ginzburg, de Rijke (eds.), Proc. Logic, Language and Computation, CSLI 1999, pp. 266-278
  • with Samir Chopra: Relevance Sensitive Belief Structures, Annals of Mathematics and Artificial Intelligence, Volume 28, 2000, pp. 259-285
  • Social Software, Synthesis, Volume 132, September 2002, 187-211.
  • with Jouko Vaananen: Finite information logic, Annals of Pure and Applied Logic, Volume 134, 2005, pp. 83-93.
  • with R. Ramanujam: A Knowledge based Semantics of Messages, Jour. Logic, Language and Information, Vol. 12, 2003, pp. 453-467.
  • Levels of Knowledge, Games, and Group Action, Research in Economics, Volume 57 2003, pp. 267-281.

Web links

Individual evidence

  1. ↑ Birth and career dates for American Men and Women of Science , Thomson Gale 2004
  2. ↑ Rohit Jivanlal Parikh in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  3. ^ Parikh, Language Generating Devices, Quartly Progress Report, Research Laboratory of Electronics, MIT 1961. Also published in Parikh, On context free languages, Journal of the ACM, Volume 13, 1960, pp. 570-581
  4. ↑ Jessica Chasmar: Brooklyn College prof. under fire for asking whether Hispanic immigrants are what 'America needs'. The Washington Times, October 24, 2018, accessed July 13, 2019 .
personal data
SURNAME Parikh, Rohit Jivanlal
BRIEF DESCRIPTION Indian-American mathematical logician
DATE OF BIRTH November 20, 1936
PLACE OF BIRTH Palanpur