共 50 条
- [2] An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2010, 6014 : 161 - +
- [3] Towards Completeness via Proof Search in the Linear Time μ-calculus PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 377 - 386
- [4] Extracting the resolution algorithm from a completeness proof for the propositional calculus LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4514 : 147 - +
- [7] Lukasiewicz mu-calculus ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (126): : 87 - 104
- [8] On a new proof of completeness of p. i. Propositional Calculus NOTE DI MATEMATICA, 2007, 27 (01): : 139 - 144
- [9] THEOREM COUNTING + LUKASIEWICZ PROPOSITIONAL CALCULUS TOPOI-AN INTERNATIONAL REVIEW OF PHILOSOPHY, 1994, 13 (01): : 61 - 65