• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Rohit Parikh

CUNY Graduate Center
  •  Home
  •  Publications
    68
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    7
  •  News and Updates
    50

 More details
  • CUNY Graduate Center
    Department of Philosophy
    Distinguished Professor
New York City, New York, United States of America
Areas of Specialization
Philosophy of Language
Logic and Philosophy of Logic
Areas of Interest
Epistemology
Philosophy of Language
Logic and Philosophy of Logic
Philosophy of Probability
  • All publications (68)
  •  229
    Sentences, Belief and Logical Omniscience, or What Does Deduction Tell Us?
    Review of Symbolic Logic 1 (4): 459-476. 2008.
    We propose a model for belief which is free of presuppositions. Current models for belief suffer from two difficulties. One is the well known problem of logical omniscience which tends to follow from most models. But a more important one is the fact that most models do not even attempt to answer the question what it means for someone to believe something, and justwhatit is that is believed. We provide a flexible model which allows us to give meaning to beliefs in general contexts, including the …Read more
    We propose a model for belief which is free of presuppositions. Current models for belief suffer from two difficulties. One is the well known problem of logical omniscience which tends to follow from most models. But a more important one is the fact that most models do not even attempt to answer the question what it means for someone to believe something, and justwhatit is that is believed. We provide a flexible model which allows us to give meaning to beliefs in general contexts, including the context of animal belief (where action is usually our only clue to a belief), and of human belief which is expressed in language.
    Logic and Philosophy of LogicClosure of KnowledgeEpistemic Logic
  • Logics of Programs Brooklyn, June 17-19, 1985 : Proceedings
    . 1985.
    Areas of Mathematics
  •  78
    Gems of theoretical computer science, Uwe schöning and Randall Pruim
    Journal of Logic, Language and Information 9 (1): 131-132. 2000.
    Science, Logic, and MathematicsPhilosophy of Artificial IntelligencePhilosophy of Artificial Intelli…Read more
    Science, Logic, and MathematicsPhilosophy of Artificial IntelligencePhilosophy of Artificial Intelligence, Miscellaneous
  •  216
    Game Logic - An Overview
    with Marc Pauly
    Studia Logica 75 (2): 165-182. 2003.
    Game Logic is a modal logic which extends Propositional Dynamic Logic by generalising its semantics and adding a new operator to the language. The logic can be used to reason about determined 2-player games. We present an overview of meta-theoretic results regarding this logic, also covering the algebraic version of the logic known as Game Algebra.
    Logic and Philosophy of LogicLogics
  •  139
    Probabilistic conditionals are almost monotonic
    with Matthew P. Johnson
    Review of Symbolic Logic 1 (1): 73-80. 2008.
    One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact that we knew P, and we have stronger information R, we c…Read more
    One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic
    Logic of ConditionalsIndicative Conditionals and Conditional Probabilities
  •  48
    Sock Sorting: An Example of a Vague Algorithm
    with Laxmi Parida and Vaughan Pratt
    Logic Journal of the IGPL 9 (5): 687-692. 2001.
    We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting
    Science, Logic, and MathematicsPhilosophy of Artificial Intelligence
  •  38
    Review of “If P, then Q; Conditionals and the Foundations of Reasoning” (review)
    Essays in Philosophy 7 (1): 12. 2006.
  •  65
    How Far Can We Formalize Language Games?
    Vienna Circle Institute Yearbook 3 89-100. 1995.
    I want to start by giving some quotes from Wittgenstein. It is part of his conception of what the foundations of Mathematics are about, a conception which many people have found peculiar and one of my defects is that I am not able to find it peculiar anymore, but find it perfectly sensible
    Science, Logic, and MathematicsPhilosophy of LinguisticsInformal Logic
  • Prev.
  • 1
  • 2
  • 3
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback