Inflationary fixed points in modal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2142, Issue , 2001, Pages 277-291

  Dawar, A ^a   Gradel E ^b   Kreutzer, S ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; ITERATIVE METHODS; TEMPORAL LOGIC;

EXPRESSIVE POWER; FINITE MODEL THEORY; FIRST ORDER LOGIC; FIXED POINT OPERATOR; FIXED POINTS; MODAL LOGIC; MODAL MU CALCULUS; MU-CALCULUS;

COMPUTER CIRCUITS;

EID: 84944183528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_20     Document Type: Conference Paper

References (17)

1. A. Arnold and D. Niwinski. Rudiments of μ-calculus, North-Holland, 2001.
2. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napoli, 1983.
3. J. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6:66–92, 1960.
4. A. Dawar. Feasible Computation Through Model Theory. PhD thesis, University of Pennsylvania, 1993.
5. A. Dawar, E. Grädel, and S. Kreutzer. Inflationary Fixed Points in Modal Logics. See “http://www.cl.cam.ac.uk/users/ad260/pubs.html” or “http://www-mgi.informatik.rwth-aachen.de/Publications/”.
6. A. Dawar and Y. Gurevich. Fixed point logics. In preparation.
7. A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. Information and Computation, 123:172–184, 1995.
8. A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119:160–175, 1994.
9. S. Dziembowski. Bounded-variable fixpoint queries are PSPACE-complete. In 10th Annual Conference on Computer Science Logic CSL 96. Selected papers, volume 1258 of Lecture Notes in Computer Science, pages 89–105. Springer, 1996.
10. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999.
11. E. Grädel and M. Otto. On logics with two variables. Theoretical Computer Science, 224:73–113, 1999.
12. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.
13. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proceedings of 7th International Conference on Concurrency Theory CONCUR’96, number 1119 in Lecture Notes in Computer Science, pages 263–277. Springer-Verlag, 1996.
14. M. Jurdzinski. Deciding the winner in parity games is in UP ∩ Co-UP. Information Processing Letters, 68:119–124, 1998.
15. M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237–265, 1999.
16. J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53:10–25, 1996.
17. M. Vardi. On the complexity of bounded-variable queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 266–267, 1995.