UvA-DARE (Digital Academic Repository) Modal fixpoint logic: some model theoretic questions Fontaine, G.M.M. Publication date 2010 Link to publication Citation for published version (APA): Fontaine, G. M. M. (2010). Modal fixpoint logic: some model theoretic questions. Institute for Logic, Language and Computation. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). 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: https://uba.uva.nl/en/contact, or 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. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:26 Sep 2021 Bibliography [AJ94] Samson Abramsky and Achim Jung. Domain Theory. In Samson Abramsky, Dov M. Gabbay Dov M., and Tom S. E. Maibaum, editors, Handbook for Logic in Computer Science.1994. [AN01] Andr´eArnold and Damian Niwi´nski. Rudiments of µ-calculus,volume 146 of Studies in Logic.2001. [Arn99] Andr´eArnold. The µ-calculus alternation-depth hierarchy is strict on binary trees. Theoretical Informatics and Applications,33(4–5),1999. [Bak80] Jaco de Bakker. Mathematical Theory of Program Correctness.1980. [Bar93] Michael Barr. Terminal coalgebras in well-founded set theory. Theo- retical Computer Sciences,114:299–315,1993. [BC96] Girish Bhat and Rance Cleaveland. Efficient model checking via the equational µ-calculus. In Proceedings of LICS’96,pages304–312,1996. [Ben76] Johan van Benthem. Modal correspondence theory.PhDthesis,Insti- tute of Logic, Language and Computation, Amsterdam, 1976. [Ben84] Johan van Benthem. Correspondence theory. In Dov M. Gabbay and Franz Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 167–248. 1984. [Ben96] Johan van Benthem. Exploring logical dynamics.1996. [Ben98] Johan van Benthem. Programming operations that are safe for bisim- ulation. Studia Logica,60(2):311–330,1998. [Ben02] Johan van Benthem. Extensive games as process models. Journal of logic, language and information,11:289–313,2002. 227 228 Bibliography [Ben05] Johan van Benthem. Guards, bounds, and generalized semantics. Journal of Logic, Language and Information,14:263–279,2005. [Ben06] Johan van Benthem. Modal frame correspondences and fixed-points. Studia Logica,83:133–155,2006. [BK08] Michael Benedikt and Christoph Koch. XPath leashed. ACM Com- puting Surveys,41(1),2008. [BL69] J.Richard B¨uchi and Lawrence H. Landweber. Solving sequential con- ditions by finite state strategies. Transactions of the American Math- ematical Society,138:295–311,1969. [BM96] Jon Barwise and Lawrence S. Moss. Vicious Circles: On the Math- ematics of Non-Wellfounded Phenomena, volume 60 of CSLI Lecture Notes.1996. [Boj07] Mikolaj Boja´nczyk. Two-way unary temporal logic over trees. In Proceedings of LICS,pages121–130,2007. [BRV01] Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal logic. 2001. [BS84] Robert Bull and Krister Segerberg. Basic modal logic. In Dov M. Gab- bay and Franz Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 1–88. 1984. [BS07] Julian C. Bradfield and Colin Stirling. Modal µ-calculi. In Patrick Blackburn, Johan van Benthem, and Frank Wolter, editors, Handbook of Modal Logics,volume3ofStudies in Logic and Practical Reasoning, pages 721–756. 2007. [BSd04] Falk Bartels, Ana Sokolova, and Erik de Vink. A hierarchy of proba- bilistic system types. Theoretical Computer Science,327:3–22,2004. [B¨uc60] J. Richard B¨uchi. Weak second-order arithmetic and finite automata. Zeitschrift f¨urMathematische Logik und Grundlagen der Mathematik, 6:60–92, 1960. [BW06] Mikolaj Boja´nczyk and Igor Walukiewicz. Characterizing EF and EX tree logics. Theoretical Computer Science,358(255-272),2006. [BW07] Mikolaj Boja´nczyk and Igor Walukiewicz. Forest algebras. In J¨org Flum, Erich Graedel, and Thomas Wilke, editors, Automata and logic: history and perspectives, number 2 in Texts in Logic and Games, pages 107–132. 2007. Bibliography 229 [Cat05] Balder ten Cate. Model theory for extended modal languages.PhD thesis, University of Amsterdam, 2005. ILLC Dissertation Series DS- 2005-01. [CE81] Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. LNCS, 131:52–71, 1981. [CK73] Chen Chung Chang and H. Jerome Keisler. Model Theory.1973. [CKP09] Corina Cˆırstea, Clemens Kupke, and Dirk Pattinson. EXPTIME tableaux for the coalgebraic µ-calculus. In Proceedings of CSL’09, pages 179–193, 2009. [Cza10] Marek Czarnecki. How fast can the fixpoints in modal µ-calculus be reached? Manuscript accepted at FICS10, 2010. [Dam94] Mads Dam. CTL* and ECTL* as fragments of the modal mu-calculus. Theoretical Computer Science,126(1):77–96,1994. [DH00] Giovanna D’Agostino and Marco Hollenberg. Logical questions con- cerning the µ-calculus: interpolation, Lyndon and Los-Tarski. Journal of Symbolic Logic,pages310–332,2000. [DO09] Anuj Dawar and Martin Otto. Modal characterisation theorems over special classes of frames. Ann. Pure Appl. Logic,161(1):1–42,2009. 1 1 [Doe89] Kees Doets. Monadic Π1-theories of Π1-properties. Notre Dame Jour- nal of Formal Logic,30(2):224–240,1989. [Don70] John Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences,4(5):77–96,1970. [DV02] Giovanna D’Agostino and Albert Visser. Finality regained: A coal- gebraic study of Scott-sets and multisets. Archive for Mathematical Logic,41:267–298,2002. [EC80] E. Allen Emerson and Edmund M. Clarke. Characterizing correct- ness properties of parallel programs using fixpoints. In Proceedings of ICALP,volume85,pages169–181,1980. [EI08]´ Zoltan Esik´ and Szabolcs Ivan. Some varieties of finite tree au- tomata related to restricted temporal logics. Fundamenta Informati- cae,82:79–103,2008. [EJ88] E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs (extended abstract). In Proceedings of FOCS,pages328–337,1988. 230 Bibliography [EJ91] E. Allen Emerson and Charanjit S. Jutla. Tree automata, µ-calculus and determinacy. In Proceedings of FOCS,pages368–377,1991. [EL86] E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In Proceedings of LICS’86,pages267–278,1986. [Elg61] Calvin C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical So- ciety,98:21–52,1961. [FBC85] Maurizio Fattorosi-Barnaba and Claudio Cerrato. Graded modalities I. Studia Logica,44:197–221,1985. [Fin72] Kit Fine. In so many possible worlds. Notre Dame Journal of Formal Logic,13:516–520,1972. [FL79] Michael Fischer and Richard Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194–211, 1979. [Fon08] Ga¨elle Fontaine. Continuous fragment of the µ-calculus. In Proceed- ings of CSL,pages139–153,2008. [FV59] Solomon Feferman and Robert Lawson Vaught. The first-order prop- erties of algebraic structures. Fundamenta Informaticae,47:57–103, 1959. [FV10] Ga¨elle Fontaine and Yde Venema. Syntactic characterizations of se- mantic properties of the µ-calculus. submitted soon, 2010. [GHK+80] Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, John Lawson, Michael Mislove, and Dana Stewart Scott. A Compendium of Contin- uous Lattices.1980. [GKP05] Georg Gottlob, Christof Koch, and Reinhard Pichler. Efficient algo- rithms for processing XPath queries. ACM Transactions on Database Systems,61(2):444–491,2005. [Gob70] Lou Goble. Grades of modality. Logique et Analyse,13:323–334,1970. [G¨od31] Kurt G¨odel. Uber¨ formal unentscheidbare s¨atze der principia math- ematica und verwandter system i. Monatschefte f¨urMathematik und Physik,38:173–198,1931. [GT75] Rob Goldblatt and S. Thomason. Axiomatic classes in propositional modal logic. In Algebra and Logic,volume450ofLecture Notes in Mathematics,pages163–173.1975. Bibliography 231 [GTW02] Erich Gr¨adel, Wolfgang Thomas, and Thomas Wilke, editors. Au- tomata, Logic, and Infinite Games,volume2500ofLNCS.2002. [Har84] David Harel. Dynamic logic. In Dov Gabbay and Franz Guenther, editors, Handbook of Philosophical Logic,volume2,pages497–604. 1984. [Hen50] Leon Henkin. Completeness in the theory of types. Journal of Sym- bolic Logic,15(2):81–91,1950. [HK04] Helle Hansen and Clemens Kupke. A coalgebraic perspective on mono- tone modal logic. Electronic Notes in Theoretical Computer Science, 106:121 – 143, 2004. Proceedings of CMCS. [Hol98a] Marco Hollenberg. Characterizations of negative definability in modal logic. Studia Logica,60:357–386,1998. [Hol98b] Marco Hollenberg. Logic and Bisimulation. PhD thesis, Utrecht Uni- versity, 1998. Zeno Institute of Philosophy. [HP78] David Harel and Vaughan R. Pratt. Non-determinism in logics of programs. In Proceedings of POPL,pages203–213,1978. [Jan96] David Janin. Propri´et´eslogiques du non-d´eterminisme et mu-calcul modal. PhD thesis, Universit´ede Bordeaux, 1996. [Jan97] David Janin.