60 found
Order:
See also
Rohit Parikh
CUNY Graduate Center
  1.  27
    A Knowledge Based Semantics of Messages.Rohit Parikh & Ramaswamy Ramanujam - 2003 - 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)  
     
    Export citation  
     
    My bibliography   29 citations  
  2.  90
    Conditional Probability and Defeasible Inference.Horacio Arlo-Costa & Rohit Parikh - manuscript
    Journal of Philosophical Logic 34, 97-119, 2005.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  3.  19
    Relevance Sensitive Belief Structures.Samir Chopra & Rohit Parikh - unknown
    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..
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography   8 citations  
  4.  43
    Social Software.Rohit Parikh - 2002 - Synthese 132 (3):187-211.
    We suggest that the issue of constructing and verifying social procedures, which we suggestively call "social software", be pursued as systematically as computer software is pursued by computer scientists. Certain complications do arise with social software which do not arise with computer software, but the similarities are nonetheless strong, and tools already exist which would enable us to start work on this important project. We give a variety of suggestive examples and indicate some theoretical work which already exists. I send (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  5.  76
    Conditional Probability and Defeasible Inference.Rohit Parikh - 2005 - 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)  
     
    Export citation  
     
    My bibliography   10 citations  
  6.  48
    The Logic of Knowledge Based Obligation.Eric Pacuit, Rohit Parikh & Eva Cogan - 2006 - 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  7.  91
    Game Logic - An Overview.Marc Pauly & Rohit Parikh - 2003 - 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)  
     
    Export citation  
     
    My bibliography   6 citations  
  8.  51
    Existence and Feasibility in Arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   35 citations  
  9.  5
    Topological Reasoning and the Logic of Knowledge.Andrew Dabrowski, Lawrence S. Moss & Rohit Parikh - 1996 - Annals of Pure and Applied Logic 78 (1-3):73-110.
    We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  10.  82
    Sentences, Belief and Logical Omniscience, or What Does Deduction Tell Us?Rohit Parikh - 2008 - 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)  
     
    Export citation  
     
    My bibliography   3 citations  
  11.  80
    Vagueness and Utility: The Semantics of Common Nouns. [REVIEW]Rohit Parikh - 1994 - 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)  
     
    Export citation  
     
    My bibliography   10 citations  
  12.  12
    Semantical Considerations on Floyd-Hoare Logic.Vaughan R. Pratt, Michael J. Fischer, Richard E. Ladner, Krister Segerberg, Tadeuz Traczyk & Rohit Parikh - 1986 - Journal of Symbolic Logic 51 (1):225-227.
    Direct download  
     
    Export citation  
     
    My bibliography   13 citations  
  13.  18
    Probabilistic Conditionals Are Almost Monotonic.Matthew P. Johnson & Rohit Parikh - 2008 - 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)  
     
    Export citation  
     
    My bibliography   3 citations  
  14.  27
    Relevance Sensitive Non-Monotonic Inference on Belief Sequences.Samir Chopra, Konstantinos Georgatos & Rohit Parikh - 2001 - Journal of Applied Non-Classical Logics 11 (1-2):131-150.
    We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  15.  53
    Vague Predicates and Language Games.Rohit Parikh - 1996 - 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)  
     
    Export citation  
     
    My bibliography   2 citations  
  16.  22
    Completeness of Certain Bimodal Logics for Subset Spaces.M. Angela Weiss & Rohit Parikh - 2002 - 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)  
     
    Export citation  
     
    My bibliography   1 citation  
  17.  40
    Logic in India—Editorial Introduction.Hans van Ditmarsch, Rohit Parikh & Ramaswamy Ramanujam - 2011 - Journal of Philosophical Logic 40 (5):557-561.
  18.  23
    Beth Definability, Interpolation and Language Splitting.Rohit Parikh - 2011 - 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  19.  16
    On Kripke's Puzzle About Time and Thought.Rohit Parikh - 2013 - In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 121--126.
    Direct download  
     
    Export citation  
     
    My bibliography  
  20.  11
    How Far Can We Formalize Language Games?Rohit Parikh - 1995 - Vienna Circle Institute Yearbook 3:89-100.
    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.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21.  28
    Length and Structure of Proofs.Rohit Parikh - 1998 - Synthese 114 (1):41-48.
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  22.  1
    Definability in Dynamic Logic.Albert R. Meyer & Rohit Parikh - 1984 - Journal of Symbolic Logic 49 (4):1420-1421.
  23.  19
    Logic in India—Editorial Introduction.Hans Ditmarsch, Rohit Parikh & R. Ramanujam - 2011 - Journal of Philosophical Logic 40 (5):557-561.
  24.  21
    What is Social Software?Jan van Eijck & Rohit Parikh - unknown
    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.
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  25.  9
    2000-2001 Spring Meeting of the Association for Symbolic Logic.Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach - 2001 - Bulletin of Symbolic Logic 7 (3):413-419.
  26.  20
    Gems of Theoretical Computer Science, Uwe Schöning and Randall Pruim.Rohit Parikh - 2000 - Journal of Logic, Language and Information 9 (1):131-132.
  27.  10
    Obituary: Horacio Arló-Costa. [REVIEW]Rohit Parikh & Helzner - 2012 - Episteme 9 (2):89-89.
    Editorial Rohit Parikh, Jeffrey Helzner, Episteme, FirstView Article.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  28.  7
    Review of “Epistemology, A Contemporary Introduction to the Theory of Knowledge”. [REVIEW]Rohit Parikh - 2008 - Essays in Philosophy 9 (2):6.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  29.  13
    Editorial Introduction.Marc Pauly & Rohit Parikh - 2003 - Studia Logica 75 (2):163-164.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  30.  4
    Indian Institute of Technology, Kanpur January 14–26, 2008.Ramon Jansana, Mai Gehrke, Alessandra Palmigiano, Mihir K. Chakraborty, Didier Dubois, Eric Pacuit, Rohit Parikh & Prakash Panangaden - 2008 - Bulletin of Symbolic Logic 14 (4).
  31.  2
    Vague Predicates and Language Games.Rohit Parikh - 1996 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 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 (2 more)  
     
    Export citation  
     
    My bibliography  
  32.  3
    Sock Sorting: An Example of a Vague Algorithm.Rohit Parikh, Laxmi Parida & Vaughan Pratt - 2001 - Logic Journal of the IGPL 9 (5):687-692.
    We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  4
    Review: Robert Goldblatt, Logics of Time and Computation. [REVIEW]Rohit Parikh - 1991 - Journal of Symbolic Logic 56 (4):1495-1496.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  34.  3
    Review: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars. [REVIEW]Rohit Parikh - 1969 - Journal of Symbolic Logic 34 (4):658-658.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35.  3
    Review: David Harel, Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. [REVIEW]Rohit Parikh - 1985 - Journal of Symbolic Logic 50 (2):552-553.
  36.  2
    Über Die Länge Yon Beweisen.Stefan Bauer-Mengelberg, Jean van Heijenoort & Rohit Parikh - 1990 - Journal of Symbolic Logic 55 (1):348-348.
    Direct download  
     
    Export citation  
     
    My bibliography  
  37.  1
    On Knowledge And Obligation.Can Başķent, Loes Loohuis & Rohit Parikh - 2012 - Episteme 9 (2):171-188.
    This article provides a brief overview of several formal frameworks concerning the relation between knowledge on the one hand, and obligation on the other. We discuss the paradox of the knower, knowledge based obligation, knowingly doing, deontic dynamic epistemology, descriptive obligations, and responsibilities as dynamic epistemology.
    Direct download  
     
    Export citation  
     
    My bibliography  
  38.  5
    Meeting of the Association for Symbolic Logic: New York City, May 1987.Martin Davis & Rohit Parikh - 1988 - Journal of Symbolic Logic 53 (4):1270-1274.
  39.  2
    1997-1998 Winter Meeting of the Association for Symbolic Logic.Rohit Parikh - 1998 - Bulletin of Symbolic Logic 4 (2):217-224.
  40.  2
    Review: Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi, Reasoning About Knowledge. [REVIEW]Rohit Parikh - 1997 - Journal of Symbolic Logic 62 (4):1484-1487.
  41.  1
    Meeting of the Association for Symbolic Logic, New York City, May 1987.Martin Davis & Rohit Parikh - 1988 - Journal of Symbolic Logic 53 (4):1270-1274.
  42.  1
    Greibach Sheila. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 42–52. [REVIEW]Rohit Parikh - 1969 - Journal of Symbolic Logic 34 (4):658.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  43.  1
    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]Rohit Parikh - 1997 - Journal of Symbolic Logic 62 (4):1484-1487.
  44.  1
    Finite Information Logic.Rohit Parikh & Jouko Väänänen - 2005 - Annals of Pure and Applied Logic 134 (1):83-93.
    We introduce a generalization of Independence Friendly logic in which Eloise is restricted to a finite amount of information about Abelard’s moves. This logic is shown to be equivalent to a sublogic of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to logic.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  45. Effectiveness.Rohit Parikh - 1980 - Philosophical Forum 12 (1):68.
     
    Export citation  
     
    My bibliography  
  46. 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]Rohit Parikh - 1995 - Journal of Symbolic Logic 60 (1):347-347.
    Direct download  
     
    Export citation  
     
    My bibliography  
  47. Goldblatt Robert. Logics of Time and Computation. CSLI Lecture Notes, No. 7. Center for the Study of Language and Information, Stanford 1987, Also Distributed by the University of Chicago Press, Chicago, Ix + 131 Pp. [REVIEW]Rohit Parikh - 1991 - Journal of Symbolic Logic 56 (4):1495-1496.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. Goldblatt Robert. Logics of Time and Computation. Second Edition 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]Rohit Parikh - 1995 - Journal of Symbolic Logic 60 (1):347.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Harel David. Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. Theoretical Computer Science, Vol. 12 , Pp. 61–81. [REVIEW]Rohit Parikh - 1985 - Journal of Symbolic Logic 50 (2):552-553.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Kreisel Georg and Tait William W.. Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 7 , Pp. 28–38. [REVIEW]Rohit Parikh - 1967 - Journal of Symbolic Logic 32 (2):270-271.
1 — 50 / 60