Albert R. Meyer and Rohit Parikh. Definability in dynamic logic. Journal of computer and system sciences, vol. 23 , pp. 279–298 [Book Review]

Journal of Symbolic Logic 49 (4):1420-1421 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274298

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Albert R. Meyer, Rohit Parikh, Definability in Dynamic Logic. [REVIEW]David Harel - 1984 - Journal of Symbolic Logic 49 (4):1420-1421.
Definability in Dynamic Logic.Albert R. Meyer & Rohit Parikh - 1984 - Journal of Symbolic Logic 49 (4):1420-1421.
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.
The Complete Bibliography of Rohit Parikh.Rohit Parikh - 2017 - In Ramaswamy Ramanujam, Lawrence Moss & Can Başkent (eds.), Rohit Parikh on Logic, Language and Society. Cham, Switzerland: Springer Verlag.
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.
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 , pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springe. [REVIEW]Robert Goldblatt - 1986 - Journal of Symbolic Logic 51 (1):225-227.
Review: Georg Kreisel, William W. Tait, Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi. [REVIEW]Rohit Parikh - 1967 - Journal of Symbolic Logic 32 (2):270-271.
Gems of theoretical computer science, Uwe schöning and Randall Pruim.Rohit Parikh - 2000 - Journal of Logic, Language and Information 9 (1):131-132.
Dynamic Deontic Logic and its Paradoxes.Albert J. J. Anglberger - 2008 - Studia Logica 89 (3):427-435.
Logics of Programs Brooklyn, June 17-19, 1985 : Proceedings.Rohit Parikh - 1985
Game Logic - An Overview.Marc Pauly & Rohit Parikh - 2003 - Studia Logica 75 (2):165-182.
Obituary: Horacio Arló-costa.Rohit Parikh & Jeffrey Helzner - 2012 - Episteme 9 (2):89-89.
Logic in India—Editorial Introduction.R. Ramanujam, Rohit Parikh & Hans van Ditmarsch - 2011 - Journal of Philosophical Logic 40 (5):557-561.
Logic in India—Editorial Introduction.Hans Ditmarsch, Rohit Parikh & R. Ramanujam - 2011 - Journal of Philosophical Logic 40 (5):557-561.
Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.

Analytics

Added to PP
2016-06-30

Downloads
20 (#749,846)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references