|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
10th Annual IEEE Symposium on Logic in Computer Science (LICS'95)
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
San Diego, California
June 26-June 29
ISBN: 0-8186-7050-6
| ASCII Text | x | ||
| Igor Walukiewicz, "Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus," Logic in Computer Science, Symposium on, pp. 14, 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), 1995. | |||
| BibTex | x | ||
| @article{ 10.1109/LICS.1995.523240, author = {Igor Walukiewicz}, title = {Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus}, journal ={Logic in Computer Science, Symposium on}, volume = {0}, year = {1995}, issn = {1043-6871}, pages = {14}, doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.1995.523240}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Logic in Computer Science, Symposium on TI - Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus SN - 1043-6871 SP EP A1 - Igor Walukiewicz, PY - 1995 KW - Mu-calculus KW - completeness KW - modal logics KW - fixpoint operators VL - 0 JA - Logic in Computer Science, Symposium on ER - | |||
We consider the propositional \m-calculus as introduced by Kozen [TCS 27]. In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete.
Index Terms:
Mu-calculus, completeness, modal logics, fixpoint operators
Citation:
Igor Walukiewicz, "Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus," lics, pp.14, 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.