Will deflation lead to depletion? On non-monotone fixed point inductions

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 158-167

  Grädel, Erich ^a   Kreutzer, Stephan ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GAME THEORY; ITERATIVE METHODS; SET THEORY; THEOREM PROVING; COMPUTER SCIENCE; COMPUTERS; DATABASE SYSTEMS; GLOSSARIES; POLYNOMIALS; SOILS; WIND;

LOGICAL FORMALISMS;

FORMAL LOGIC; ARTIFICIAL INTELLIGENCE;

DESCRIPTION LANGUAGES; FIXED POINTS; GREATEST FIXED POINTS; LOGIC; LOGICAL FORMALISM; POWER GENERATION ECONOMICS;

EID: 0042969221     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, volume 90 of Studies in Logic, pages 739-782. North-Holland, 1977.
2. J. van Benthem. One is a lonely number. Technical Report ILLC Research Report PP-2003-07, Institute for Logic, Language and Computation, University of Amsterdam, 2003.
3. J. Bradfield. The modal μ-calculus alternation hierarchy is strict. Theoretical Computer Science, 195:133-153, 1998.
4. A. Dawar, E. Grädel, and S. Kreutzer. Inflationary fixed points in modal logic. ACM Transactions on Computational Logic, 2003. To appear.
5. A. Dawar and S. Kreutzer. Generalising automaticity to modal properties of finite structures. In Proc. 22nd FSTTCS, LNCS 2556, pages 109-120. Springer, 2002.
6. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition edition, 1999.
7. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning About Knowledge. MIT Press, 1995.
8. E. Grädel. Finite model theory and descriptive complexity. In Finite Model Theory and Its Applications. Springer-Verlag, 2003. To appear.
9. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265-280, 1986.
10. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86-104, 1986.
11. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proc. of 7th International Conference on Concurrency Theory CONCUR '96, LNCS 1119, pages 263-277. Springer-Verlag, 1996.
12. M. Jurdziński. Small progress measures for solving parity games. In STACS 2000, volume 1770 of LNCS, pages 290-301. Springer, 2000.
13. S. Kreutzer. Expressive equivalence of least and inflationary fixed point logic. In Proceedings of 17th IEEE Symp. on Logic in Computer Science LICS02, pages 403-410, 2002.
14. S. Kreutzer. Pure and Applied Fixed Point Logic. PhD thesis, Aachen University, 2002.
15. J. Miller and L. Moss. The undecidability of iterated modal relativization. Manuscript, Indiana University, 2003.
16. Y. Moschovakis. Elementary induction on abstract structures. North Holland, 1974.
17. Y. Moschovakis. On non-monotone inductive definability. Fundamentae Mathematica, 82(82):39-83, 1974.
18. M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237-265, 1999.
19. C. Stirling. Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997.
20. M. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 137-146, 1982.