Civil Rights
Movements, leaders, victories and the continuing fight for equality.
q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
Wilmington, North Carolina once had a thriving Black middle class and an elected interracial government. In 1898 white supremacists used violence to overthrow that government, kill Black residents and drive many others from the city.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985
Rohit Jivanlal Parikh | |
|---|---|
 Parikh in 2004 | |
| Education | 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 |
| Workplaces | Brooklyn College CUNY Graduate Center |
| Hartley Rogers, Jr Burton Dreben | |
Doctoral students | |
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]
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]
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]
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]
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.[12]
Parikh is a nontheist opposing abortions. To fight abortions he joined the Atheist and Agnostic Pro-Life League.[13]
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
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. He has been a Distinguished Professor at Brooklyn College at the City University of New York (CUNY) (1982-2023).
Parikh is a name found among Hindus, Jains and Memon from India. It means assayer in the Gujarati language and has its roots in the Sanskrit word for examiner. Both the Oswal and Porwal communities of India, Canada and United States have clans called Parekh. People bearing the name, who may or may not be affiliated with the above communities, include: Shrenu Parikh, Indian television actress Narhari Parikh, Indian freedom fighter and social reformer Rahul Parikh, American pediatrician Rasiklal Chhotalal Parikh, Gujarati writer, poet, and Indologist Rohit Jivanlal Parikh, Indian-American mathematician and logician Himanshu Parikh, Indian architect Jayant Parikh, Indian painter, printmaker, and muralist Vasant Parikh, Indian politician and social worker Deepak Parikh, CEO of Clariant Chemicals India Tej Parikh, former Chief Economist, Institute of Directors
In philosophy and the social sciences, social software is an interdisciplinary research program that borrows mathematical tools and techniques from game theory and computer science in order to analyze and design social procedures. The goals of research in this field are modeling social situations, developing theories of correctness, and designing social procedures. Work under the term social software has been going on since about 1996, and conferences in Copenhagen, London, Utrecht and New York, have been partly or wholly devoted to it. Much of the work is carried out at the City University of New York under the leadership of Rohit Jivanlal Parikh, who was influential in the development of the field.
Bounded arithmetic is a collective name for a family of weak subtheories of Peano arithmetic. Such theories are typically obtained by requiring that quantifiers be bounded in the induction axiom or equivalent postulates (a bounded quantifier is of the form ∀x ≤ t or ∃x ≤ t, where t is a term not containing x). The main purpose is to characterize one or another class of computational complexity in the sense that a function is provably total if and only if it belongs to a given complexity class. Further, theories of bounded arithmetic present uniform counterparts to standard propositional proof systems such as Frege system and are, in particular, useful for constructing polynomial-size proofs in these systems. The characterization of standard complexity classes and correspondence to propositional proof systems allows to interpret theories of bounded arithmetic as formal systems capturing various levels of feasible reasoning (see below). The approach was initiated by Rohit Jivanlal Parikh in 1971, and later developed by Samuel R. Buss. and a number of other logicians.
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Madam C.J. Walker
