Publication
Theoretical Computer Science
Paper

Results on the propositional μ-calculus

View publication

Abstract

In this paper we define and study a propositional μ-calculus Lμ, which consists essentially of propositional modal logic with a least fixpoint operator. Lμ is syntactically simpler yet strictly more expressive than Propositional Dynamic Logic (PDL). For a restricted version we give an exponential-time decision procedure, small model property, and complete deductive system, theory subsuming the corresponding results for PDL. © 1983.

Date

01 Jan 1983

Publication

Theoretical Computer Science

Authors

Topics

Share