See this document in CiteSeerX!

A Note On The Completeness Of Kozen's Axiomatisation Of The Propositional µ-Calculus (1996)  (Make Corrections)  (3 citations)
Igor Walukiewicz
Bulletin of Symbolic Logic



  Home/Search   Context   Related

 
View or download:
ucla.edu/~asl/bsl/0203/0203005.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  aslonline.org/asl/BSL/contents (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The propositional µ-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete. (Update)

Context of citations to this paper:   More

...with respect to so called aconjunctive formulae. The full completeness was proved only quite recently by I. Walukiewicz, see [Wal95] Wal96] Moreover, Kozen proved that calculus has the finite model property and is decidable with EXPTIME complete satisfiability problem. With...

.... models) The decade it took from the creation of the modal calculus and its proposed axiomatization in [76] to a completeness proof in [124] bears witness to the fact that the conceptual complexity of this logic far exceeds that of Propositional Dynamic Logic, even though,...

Cited by:   More
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000)   (Correct)
Logical for Social Software - Pauly (2001)   (Correct)
Temporal Logics of Computations - Introductory Course - Goranko (2000)   (Correct)

Similar documents (at the sentence level):
22.1%:   Completeness of Kozen's Axiomatisation of the Propositional.. - Walukiewicz (1995)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Program Logics: theory and applications - Shilov   (Correct)
0.3:   Program Logics Made Easy - Yi, Shilov   (Correct)
0.2:   Using Automata to Characterise Fixed Point Temporal Logics - Kaivola (1996)   (Correct)

Similar documents based on text:   More   All
0.4:   Process Algebra with Recursive Operations - Bergstra, Fokkink, Ponse   (Correct)
0.4:   Basic Process Algebra With Iteration: Completeness of Its.. - Fokkink, Zantema (1994)   (Correct)
0.3:   Axiomatising Extended Computation Tree Logic - Kaivola (1996)   (Correct)

Related documents from co-citation:   More   All
4:   The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
4:   The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
4:   Decision procedures and expressiveness in the temporal logic of branching time (context) - Emerson, Halpern - 1985

BibTeX entry:   (Update)

Igor Walukiewicz. A note on the completeness of Kozen's axiomatisation of the propositional -calculus. The Bulletin of Symbolic Logic, 2(3):349--366, September 1996. http://citeseer.ist.psu.edu/walukiewicz96note.html   More

@article{ walukiewicz96note,
    author = "Igor Walukiewicz",
    title = "A Note on the Completeness of {K}ozen's Axiomatization of the Propositional $\mu$-Calculus",
    journal = "Bulletin of Symbolic Logic",
    volume = "2",
    number = "3",
    pages = "349--366",
    year = "1996",
    url = "citeseer.ist.psu.edu/walukiewicz96note.html" }
Citations (may not include all citations):
242   Proof methods for modal and intuitionistic logics (context) - Fitting - 1983
241   Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
190   Results on the propositional -calculus (context) - Kozen - 1983
131   The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988  ACM   DBLP
120   Handbook of theoretical computer science (context) - Emerson, modal - 1990
34   Regular expressions for infinite trees and a standard form o.. (context) - Mostowski - 1984
16   Fixed points vs (context) - nski - 1988
15   Handbook of theoretical computer science (context) - Kozen, Tiuryn et al. - 1990
13   Handbook of philosophical logic (context) - Harel, logic - 1984
5   Handbook of philosophical logic (context) - Bull, Segerberg et al. - 1984
4   Buchi's monadic second order successor arithmetic (context) - Siefkes - 1970
1   Axiomatising linear time -calculus (context) - Kaivola - 1995
1   Studia Logica (context) - model, the et al. - 1988
1   to appear in Theoretical Computer Science; available from: h.. (context) - nski, Walukiewicz et al. - 1994
1   Lecture Notes in Computer Science (context) - Janin, Walukiewicz et al. - 1995
1   Handbook of logic in comuter science (context) - Stirling, temporal - 1991
1   An automata theoretic procedure for the propositional -calcu.. (context) - Streett, Emerson - 1989
1   BASIC RESEARCH IN COMPUTER SCIENCE CENTRE OF THE DANISH NATI.. (context) - Walukiewicz, of et al. - 1993

Documents on the same site (http://www.aslonline.org/asl/BSL/contents.html):   More
Alonzo Church's contributions to philosophy and Intensional Logic - Anderson (1998)   (Correct)
Is A Core Model Below - John Steel In   (Correct)
The Impact of the Lambda Calculus in Logic and Computer Science - Barendregt (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC