44 found
Sort by:
See also:
Profile: Rohit Parikh (City University of New York, City University of New York)
  1. Horacio Arlo-Costa & Rohit Parikh, Conditional Probability and Defeasible Inference.
    Journal of Philosophical Logic 34, 97-119, 2005.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Samir Chopra & Rohit Parikh, Relevance Sensitive Belief Structures.
    We propose a new relevance sensitive model for representing and revising belief structures, which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically plausible, computationally tractable procedures for query answering and belief..
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  3. Konstantinos Georgatos & Rohit Parikh, Relevance Sensitive Non-Monotonic Inference.
    logically open sequence of propositional formulas as a representation for beliefs and orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations are ternary (using context as a parameter) as opposed to standard binary axioma-.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Jan van Eijck & Rohit Parikh, What is Social Software?
    It is a sunny autumn day, and our protagonists have taken their meals outside, to enjoy the mild rays of the September sun. The NIAS cook Paul Nolte, as always glowing with pride while serving out his delicious food, has prepared a traditional Dutch meal today with sausage, red cabbage and pieces of apple.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  5. Rohit Parikh (2013). On Kripke's Puzzle About Time and Thought. In Kamal Lodaya (ed.), Logic and its Applications. Springer. 121--126.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Rohit Parikh & Helzner (2012). Obituary: Horacio Arló-Costa. [REVIEW] Episteme 9 (2):89-89.
    Editorial Rohit Parikh, Jeffrey Helzner, Episteme , FirstView Article.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Hans Ditmarsch, Rohit Parikh & R. Ramanujam (2011). Logic in India—Editorial Introduction. Journal of Philosophical Logic 40 (5):557-561.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. Rohit Parikh (2011). Beth Definability, Interpolation and Language Splitting. Synthese 179 (2):211 - 221.
    Both the Beth definability theorem and Craig's lemma (interpolation theorem from now on) deal with the issue of the entanglement of one language L1 with another language L2, that is to say, information transfer—or the lack of such transfer—between the two languages. The notion of splitting we study below looks into this issue. We briefly relate our own results in this area as well as the results of other researchers like Kourousias and Makinson, and Peppas, Chopra and Foo.Section 3 does (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Hans van Ditmarsch, Rohit Parikh & Ramaswamy Ramanujam (2011). Logic in India—Editorial Introduction. Journal of Philosophical Logic 40 (5):557-561.
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Ramon Jansana, Mai Gehrke, Alessandra Palmigiano, Mihir K. Chakraborty, Didier Dubois, Eric Pacuit, Rohit Parikh & Prakash Panangaden (2008). Indian Institute of Technology, Kanpur January 14–26, 2008. Bulletin of Symbolic Logic 14 (4).
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Matthew P. Johnson & Rohit Parikh (2008). Probabilistic Conditionals Are Almost Monotonic. Review of Symbolic Logic 1 (1):73-80.
    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 (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  12. Rohit Parikh (2008). Review of “Epistemology, A Contemporary Introduction to the Theory of Knowledge”. [REVIEW] Essays in Philosophy 9 (2):6.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  13. Rohit Parikh (2008). Sentences, Belief and Logical Omniscience, or What Does Deduction Tell Us? Review of Symbolic Logic 1 (4):459-476.
    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 just what it is that is believed. We provide a flexible model which allows us to give meaning (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  14. Eric Pacuit, Rohit Parikh & Eva Cogan (2006). The Logic of Knowledge Based Obligation. Synthese 149 (2):311 - 341.
    Deontic Logic goes back to Ernst Mally’s 1926 work, Grundgesetze des Sollens: Elemente der Logik des Willens [Mally. E.: 1926, Grundgesetze des Sollens: Elemente der Logik des Willens, Leuschner & Lubensky, Graz], where he presented axioms for the notion ‘p ought to be the case’. Some difficulties were found in Mally’s axioms, and the field has much developed. Logic of Knowledge goes back to Hintikka’s work Knowledge and Belief [Hintikka, J.: 1962, Knowledge and Belief: An Introduction to the Logic of (...)
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  15. Rohit Parikh (2006). Modal Logic and Possible Worlds. In Henrik Lagerlund, Sten Lindström & Rysiek Sliwinski (eds.), Modality Matters: Twenty-Five Essays in Honour of Krister Segerberg. Uppsala Philosophical Studies 53. 53--339.
    No categories
     
    My bibliography  
     
    Export citation  
  16. Rohit Parikh (2006). Review of “If P, Then Q; Conditionals and the Foundations of Reasoning”. [REVIEW] Essays in Philosophy 7 (1):12.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Horacio Arló Costa & Rohit Parikh (2005). Conditional Probability and Defeasible Inference. Journal of Philosophical Logic 34 (1):97 - 119.
    We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. Rohit Parikh (2005). Conditional Probability and Defeasible Inference. Journal of Philosophical Logic 34 (1):97 - 119.
    We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  19. Rohit Parikh & Jouko Väänänen (2005). Finite Information Logic. Annals of Pure and Applied Logic 134 (1):83-93.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. Rohit Parikh & Ramaswamy Ramanujam (2003). A Knowledge Based Semantics of Messages. Journal of Logic, Language and Information 12 (4):453-467.
    We investigate the semantics of messages, and argue that the meaning ofa message is naturally and usefully given in terms of how it affects theknowledge of the agents involved in the communication. We note thatthis semantics depends on the protocol used by the agents, and thus not only the message itself, but also the protocol appears as a parameter in the meaning. Understanding this dependence allows us to give formal explanations of a wide variety of notions including language dependence, implicature, (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  21. Marc Pauly & Rohit Parikh (2003). Editorial Introduction. Studia Logica 75 (2):163-164.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Marc Pauly & Rohit Parikh (2003). Game Logic - an Overview. Studia Logica 75 (2):165 - 182.
    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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  23. Rohit Parikh (2002). Social Software. Synthese 132 (3):187 - 211.
    We suggest that the issue of constructing andverifying social procedures, which we suggestively call socialsoftware, be pursued as systematically as computer software is pursued by computer scientists. Certain complications do arise withsocial software which do not arise with computer software, but thesimilarities are nonetheless strong, and tools already exist which wouldenable us to start work on this important project. We give a variety ofsuggestive examples and indicate some theoretical work which alreadyexists.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. M. Angela Weiss & Rohit Parikh (2002). Completeness of Certain Bimodal Logics for Subset Spaces. Studia Logica 71 (1):1 - 30.
    Subset Spaces were introduced by L. Moss and R. Parikh in [8]. These spaces model the reasoning about knowledge of changing states.In [2] a kind of subset space called intersection space was considered and the question about the existence of a set of axioms that is complete for the logic of intersection spaces was addressed. In [9] the first author introduced the class of directed spaces and proved that any set of axioms for directed frames also characterizes intersection spaces.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Samir Chopra, Konstantinos Georgatos & Rohit Parikh (2001). Relevance Sensitive Non-Monotonic Inference on Belief Sequences. Journal of Applied Non-Classical Logics 11 (1-2):131-150.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach (2001). 2000-2001 Spring Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 7 (3).
     
    My bibliography  
     
    Export citation  
  27. Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach (2001). The Minneapolis Hyatt Regency, Minneapolis, Minnesota May 3–4, 2001. Bulletin of Symbolic Logic 7 (3).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  28. Rohit Parikh (2000). Gems of Theoretical Computer Science, Uwe Schöning and Randall Pruim. Journal of Logic, Language and Information 9 (1):131-132.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  29. Rohit Parikh (1998). Length and Structure of Proofs. Synthese 114 (1):41-48.
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  30. Rohit Parikh (1998). 1997-1998 Winter Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 4 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  31. Rohit Parikh (1997). Fagin Ronald, Halpern Joseph Y., Moses Yoram, and Vardi Moshe Y.. Reasoning About Knowledge. MIT Press, Cambridge, Mass., and London 1995, Xiii+ 477 Pp. [REVIEW] Journal of Symbolic Logic 62 (4):1484-1487.
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. Rohit Parikh (1997). Review: Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi, Reasoning About Knowledge. [REVIEW] Journal of Symbolic Logic 62 (4):1484-1487.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Andrew Dabrowski, Lawrence S. Moss & Rohit Parikh (1996). Topological Reasoning and the Logic of Knowledge. Annals of Pure and Applied Logic 78 (1-3):73-110.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  34. Rohit Parikh (1996). Some Reminiscences of Kreisel. In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters. 89.
    No categories
     
    My bibliography  
     
    Export citation  
  35. Rohit Parikh (1996). Vague Predicates and Language Games. Theoria 11 (3):97-107.
    Attempts to give a Logic or Semantics for vague predicates and to defuse the Sorites paradoxes have been largely a failure. We point out yet another problem with these predicates which has not been remarked on before,namely that different people do and must use these predicates in individually different ways. Thus even if there were a semantics for vague predicates, people would not be able to share it. To explain the occurrence nonetheless of these troublesome predicates in language, we propose (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Rohit Parikh (1995). Goldblatt Robert. Logics of Time and Computation. Of LVI 1495. CSLI Lecture Notes, No. 7. Center for the Study of Language and Information, Stanford 1992, Also Distributed by the University of Chicago Press, Chicago, Ix+ 180 Pp. [REVIEW] Journal of Symbolic Logic 60 (1):347-347.
    Direct download  
     
    My bibliography  
     
    Export citation  
  37. Rohit Parikh (1994). Vagueness and Utility: The Semantics of Common Nouns. [REVIEW] Linguistics and Philosophy 17 (6):521 - 535.
    A utility-based approach to the understanding of vague predicates (VPs) is proposed. It is argued that assignment of truth values to propositions containing VPs entails unjustifiable assumptions of consensus; two models of VP semantics are criticized on this basis: (1) the super-truth theory of Kit Fine (1975), which requires an unlikely consensus on base points; (2) the fuzzy logic of Lotfi Zadeh (1975), on fuzzy truth values of sentences. Pragmatism is held to provide a key: successful behavior justifies a person's (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  38. Rohit Parikh (1991). Review: Robert Goldblatt, Logics of Time and Computation. [REVIEW] Journal of Symbolic Logic 56 (4):1495-1496.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Martin Davis & Rohit Parikh (1988). Meeting of the Association for Symbolic Logic: New York City, May 1987. Journal of Symbolic Logic 53 (4):1270-1274.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Rohit Parikh (1985). Review: David Harel, Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. [REVIEW] Journal of Symbolic Logic 50 (2):552-553.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Rohit Parikh (1971). Existence and Feasibility in Arithmetic. Journal of Symbolic Logic 36 (3):494-508.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Rohit Parikh (1969). Review: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars. [REVIEW] Journal of Symbolic Logic 34 (4):658-658.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Rohit Parikh (1967). Review: Georg Kreisel, William W. Tait, Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi. [REVIEW] Journal of Symbolic Logic 32 (2):270-271.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation