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 [Book Review]

Journal of Symbolic Logic 51 (1):225-227 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273958

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,836

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

A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. [REVIEW]Steven S. Muchnick - 1977 - Journal of Symbolic Logic 42 (3):422-423.
Lachlan A. H.. A note on Thomason's refined structures for tense logics. Theoria, vol. 40, pp. 117–120.Fine Kit. Some connections between elementary and modal logic. Proceedings of the Third Scandinavian Logic Symposium, edited by Ranger Stig, Studies in logic and the foundations of mathematics, vol. 82, North-Holland Publishing Company, Amsterdam and Oxford, and American Elsevier Publishing Company, Inc., New York, 1975, pp. 1–14.Goldblatt R. I. and Thomason S. K.. Axiomatic classes in propositional modal logic. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by Crossley J. N., Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 163–173.Goldblatt R. I.. First-order definability in modal logic. [REVIEW]Robert A. Bull - 1982 - Journal of Symbolic Logic 47 (2):440-445.
Mathematical Foundations of Computer Science 1991 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991 : Proceedings.Andrzej Tarlecki & International Symposium on Mathematical Foundations of Computer Science - 1991
Albert R. Meyer and Rohit Parikh. Definability in dynamic logic. Journal of computer and system sciences, vol. 23 , pp. 279–298. [REVIEW]David Harel - 1984 - Journal of Symbolic Logic 49 (4):1420-1421.
J. B. Paris. A hierarchy of cuts in models of arithmetic. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 312–337. - George Mills. A tree analysis of unprovable combinatorial statements. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, pp. 248–311. - Jussi Ketonen and Robert Solovay. Rapidly growing Ramsey functions. Annals of mathematics, ser. 2 vol. 113 , pp. 267–314. [REVIEW]A. J. Wilkie - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
Feferman Solomon. A language and axioms for explicit mathematics. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by Crossley J. N., Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 87–139.Feferman Solomon. Constructive theories of functions and classes. Logic colloquium '78, Proceedings of the colloquium held in Mons, August 1978, edited by Boffa Maurice, van Dalen Dirk, and McAloon Kenneth, Studies in logic and the foundations of mathematics, vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, pp. 159–224. [REVIEW]G. R. Renardel de Lavalette & A. S. Troelstra - 1984 - Journal of Symbolic Logic 49 (1):308-311.
Logic at Botik '89: Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Proceedings.Albert R. Meyer & Michael A. Taitslin - 1989 - Springer Verlag.
Goldblatt Robert. Axiomatising the logic of computer programming. Lecture notes in computer science, vol. 130. Springer-Verlag, Berlin, Heidelberg, and New York, 1982, xi + 304 pp. [REVIEW]Mitchell Wand - 1985 - Journal of Symbolic Logic 50 (3):854-855.
Joseph Becker and Leonard Lipshitz. Remarks on the elementary theories of formal and convergent power series. Fundament a mathematicae, vol. 105 , pp. 229–239. - Françoise Delon. Indécidabilité de la théorie des anneaux de séries formelles à plusiers indéterminées. Fundament a mathematicae, vol. 112 , pp. 215–229. - J. Becker, J. Denef, and L. Lipshitz. Further remarks on the elementary theory of formal power series rings. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 1–9. - Françoise Delon. Hensel fields in equal characteristic p > 0. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by. [REVIEW]S. Basarab - 1985 - Journal of Symbolic Logic 50 (3):853-854.
Many-sorted Logic and Its Applications.K. Meinke & J. V. Tucker - 1993 - Wiley.

Analytics

Added to PP
2016-06-30

Downloads
73 (#305,893)

6 months
16 (#183,267)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.

Add more citations

References found in this work

No references found.

Add more references