Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Finite Model Theorem for the Propositional μ-Calculus

Dexter Kozen
Studia Logica: An International Journal for Symbolic Logic
Vol. 47, No. 3 (1988), pp. 233-241
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015378
Page Count: 9
  • Download ($43.95)
  • Cite this Item
A Finite Model Theorem for the Propositional μ-Calculus
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
[233]
    [233]
  • Thumbnail: Page 
234
    234
  • Thumbnail: Page 
235
    235
  • Thumbnail: Page 
236
    236
  • Thumbnail: Page 
237
    237
  • Thumbnail: Page 
238
    238
  • Thumbnail: Page 
239
    239
  • Thumbnail: Page 
240
    240
  • Thumbnail: Page 
241
    241