Results on the propositional \(\mu\)-calculus (Q801893)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Results on the propositional -calculus |
scientific article; zbMATH DE number 3880653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Results on the propositional \(\mu\)-calculus |
scientific article; zbMATH DE number 3880653 |
Statements
Results on the propositional \(\mu\)-calculus (English)
0 references
1983
0 references
In this paper we define and study a propositional \(\mu\)-calculus \(L\mu\), which consists essentially of propositional modal logic with a least fixpoint operator. \(L\mu\) 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, thereby subsuming the corresponding results for PDL.
0 references
fixed point induction
0 references
completeness
0 references
propositional mu-calculus
0 references
propositional modal logic
0 references
decision procedure
0 references
small model property
0 references
PDL
0 references
0.8689650893211365
0 references
0.8646885752677917
0 references
