• DocumentCode
    3290127
  • Title

    Completeness of Kozen´s axiomatisation of the propositional μ-calculus

  • Author

    Walukiewicz, I.

  • Author_Institution
    Dept. of Comput. Sci., Aarhus Univ.
  • fYear
    1995
  • fDate
    26-29 Jun 1995
  • Firstpage
    14
  • Lastpage
    24
  • Abstract
    We consider the propositional μ-calculus as introduced by D. Kozen (1983). In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete
  • Keywords
    temporal logic; theorem proving; completeness of Kozen´s axiomatisation; natural proof system; propositional μ-calculus; Automata; Calculus; Computer science; Informatics; Logic; Technological innovation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
  • Conference_Location
    San Diego, CA
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-7050-9
  • Type

    conf

  • DOI
    10.1109/LICS.1995.523240
  • Filename
    523240
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3290127