A finite model theorem for the propositional μ-calculus

Studia Logica 47 (3):233 - 241 (1988)
  Copy   BIBTEX

Abstract

We prove a finite model theorem and infinitary completeness result for the propositional -calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of well-quasi-orders.

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: 104,856

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
48 (#507,375)

6 months
7 (#624,698)

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.
Undecidability results on two-variable logics.Erich Grädel, Martin Otto & Eric Rosen - 1999 - Archive for Mathematical Logic 38 (4-5):313-354.
Completions of μ-algebras.Luigi Santocanale - 2008 - Annals of Pure and Applied Logic 154 (1):27-50.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references