On modal μ-calculus and non-well-founded set theory

Journal of Philosophical Logic

Volumn 33, Issue 4, 2004, Pages 343-360

  Alberucci, Luca ^a   Salipante, Vincenzo ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Alternating tree automata; Bisimulation; Modal calculus; Non well founded sets; Transition systems

Indexed keywords

EID: 70949092698     PISSN: 00223611     EISSN: 15730433     Source Type: Journal    
DOI: 10.1023/B:LOGI.0000036771.59434.71     Document Type: Article

References (16)

1. Aczel, P.: Non-Well-Founded Sets, CSLI Publications, Stanford, 1988.
2. Alberucci, L.: Strictness of the modal mu-calculus hierarchy, in E. Grädel, W. Thomas, and T. Wilke (eds.), Automata, Logics and Infinite Games, LNCS 2500, 2002, pp. 185-201.
3. Baltag, A.: STS: A structural theory of sets, Logic J. IGPL 7(4) (1999), 481-515.
4. Barwise, J. and Moss, L.: Vicious Circles, CSLI Publications, Stanford, 1996.
5. Bernays, P.: A system of axiomatic set theory - Part VII, J. Symbolic Logic 19 (1954), 81-96.
6. Bradfield, J. and Stirling, C.: Modal logic and mu-calculi, in J. Bergstra, A. Ponse, and S. Smolka (eds.), Handbook of Process Algebra, North-Holland, 2001, pp. 293-332.
7. Forster, T. E.: Set Theory with a Universal Set, 2nd edn, Oxford Sci. Publications, 1995.
8. Kozen, D.: Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983),333-354.
9. Mirimianoff, D.: Les antinomies de Russel et de Burali-Forti et le problème fondamental de la théorie des ensembles, Enseign. Math. 19 (1917), 37-52.
10. Mirimianoff, D.: Remarques sur la théorie des ensembles, Enseign. Math. 19 (1917), 209-217.
11. Niwinski, D.: Fixed point characterization of infinite behavior of finite-state systems, Theoret. Comput. Sci. 189(1-2) (1997), 1-69. Fundamental Study.
12. Scott, D. and De Bakker, J.: A theory of programs, Unpublished manuscript, IBM, Vienna, 1969.
13. Steffen, B.: Characteristic formulae, in Concur'89, LNCS 372, 1989, pp. 723-732.
14. Streett, R. S. and Emerson, E. A.: An automata theoretic decision procedure for the propositional mu-calculus, Inform. and Comput. 81 (1989), 249-264.
15. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955),285-309.
16. Wilke, T.: Alternating tree automata, parity games, and modal μ-calculus, Bull. Soc. Math. Belg. 8(2) (2001).