An easy completeness proof for the modal μ-calculus on finite trees

Autor:	ten Cate, B., Fontaine, G., Matthes, R., Uustalu, T.
Přispěvatelé:	Information and Language Processing Syst (IVI, FNWI), Logic and Computation (ILLC, FNWI/FGw), ILLC (FNWI)
Rok vydání:	2010
Zdroj:	6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings, 30-38 STARTPAGE=30;ENDPAGE=38;TITLE=6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=narcis______::b5616390fa736ccdc329c41caf1d7d0b https://dare.uva.nl/personal/pure/en/publications/an-easy-completeness-proof-for-the-modal-calculus-on-finite-trees(5aac9d57-3250-4270-8922-5774b1810700).html Zobrazit plný text záznamu