- Author
- Title
- Modal fixpoint logic: some model theoretic questions
- Supervisors
- Award date
- 9 December 2010
- Number of pages
- 246
- Publisher
- Amsterdam: Institute for Logic, Language and Computation
- ISBN
- 9789057762154
- Document type
- PhD thesis
- Faculty
- Interfacultary Research
- Institute
- Institute for Logic, Language and Computation (ILLC)
- Abstract
- This thesis is a study into some model-theoretic aspects of the modal µ-calculus, the extension of modal logic with least and greatest fixpoint operators. We explore these aspects through a fine-structure approach to the µ-calculus. That is, we concentrate on special classes of structures and particular fragments of the language. The methods we use also illustrate the fruitful interaction between the µ-calculus and other methods from automata theory, game theory and model theory.
- Note
- ILLC dissertation series DS-2010-09
Research conducted at: Universiteit van Amsterdam - Persistent Identifier
- https://hdl.handle.net/11245/1.329510
- Downloads
-
Thesis
Cover
Title pages
Contents
Acknowledgments
Chapter 1: Introduction
Chapter 2: Preliminaries
Chapter 3: Completeness for the μ-calculus on finite trees
Chapter 4: The μ-calculus and frame definability on trees
Chapter 5: Characterizations of fragments of the μ-calculus
Chapter 6: CoreXPath restricted to the descendant relation
Chapter 7: Automata for coalgebras: an approach using predicate liftings
Chapter 8: Conclusion
Bibliography
Index
List of symbols
Samenvatting
Abstract
Titles in the ILLC dissertation series
Disclaimer/Complaints regulations
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.