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

Links

PhilArchive



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

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

Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
A propositional dynamic logic with qualitative probabilities.Dimitar P. Guelev - 1999 - Journal of Philosophical Logic 28 (6):575-604.
Deductive completeness.Kosta Došen - 1996 - Bulletin of Symbolic Logic 2 (3):243-283.
Sequential Dynamic Logic.Alexander Bochman & Dov M. Gabbay - 2012 - Journal of Logic, Language and Information 21 (3):279-298.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
An analytic completeness theorem for logics with probability quantifiers.Douglas N. Hoover - 1987 - Journal of Symbolic Logic 52 (3):802-816.
A Sahlqvist theorem for relevant modal logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Algebras of intervals and a logic of conditional assertions.Peter Milne - 2004 - Journal of Philosophical Logic 33 (5):497-548.
The mathematics of logic: a guide to completeness theorems and their applications.Richard Kaye - 2007 - New York: Cambridge University Press.
A new semantics for intuitionistic predicate logic.Yuichi Komori - 1986 - Studia Logica 45 (1):9 - 17.
From intuitionistic logic to dynamic operational quantum logic.Sonja Smets - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):257-275.
A Kripke semantics for the logic of Gelfand quantales.Gerard Allwein & Wendy MacCaull - 2001 - Studia Logica 68 (2):173-228.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,078,270)

6 months
3 (#967,057)

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