A completeness theorem for dynamic logic

Notre Dame Journal of Formal Logic 26 (1):51-60 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093870760

Other Versions

No versions found

Links

PhilArchive

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 semi-completeness theorem.Stephen L. Bloom - 1969 - Notre Dame Journal of Formal Logic 10 (3):303-308.
A strong completeness theorem for $3$-valued logic. [REVIEW]H. Goldberg, H. Leblanc & G. Weaver - 1974 - Notre Dame Journal of Formal Logic 15 (2):325-330.
A rule-completeness theorem.Nuel D. Belnap & Richmond H. Thomason - 1963 - Notre Dame Journal of Formal Logic 4 (1):39-43.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
A Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
A strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.
Post's functional completeness theorem.Francis Jeffry Pelletier & Norman M. Martin - 1990 - Notre Dame Journal of Formal Logic 31 (3):462-475.
An arithmetical completeness theorem for pre-permutations.Friedemann Tuttas - 1992 - Notre Dame Journal of Formal Logic 34 (1):84-89.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66.David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
The completeness of an intensional logic: definite topological logic.James W. Garson - 1973 - Notre Dame Journal of Formal Logic 14 (2):175-184.

Analytics

Added to PP
2010-08-24

Downloads
74 (#789,983)

6 months
11 (#1,082,321)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Strong Semantical Characterization for Nondeterministic Programs.Laszlo Csirmaz - 1987 - Mathematical Logic Quarterly 33 (5):407-416.

Add more citations

References found in this work

No references found.

Add more references