Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2008: Computer Science Logic pp 23–31Cite as

Model Transformations in Decidability Proofs for Monadic Theories

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5213))

Abstract

We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and – depending on the fragment – reduces the model under consideration to a simpler one. In the second approach, one applies a global transformation of models while preserving decidability of the theory. We suggest a combination of these two methods.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: [11], pp. 285–302

    Google Scholar 

  2. Blumensath, A., Colcombet, T., Löding, C.: Logical theories and compatible operations. In: Flum, J., et al. (eds.) Logic and Automata, pp. 73–106. Amsterdam Univ. Press, Amsterdam (2007)

    Google Scholar 

  3. Blumensath, A.: On the structure of graphs in the Caucal hierarchy. Theor. Comput. Sci. 400, 19–45 (2008)

    Article  MATH  Google Scholar 

  4. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Nagel, E., et al. (eds.) Logic, Methodology, and Philosophy of Science: Proceedings of the 1960 International Congress, pp. 1–11. Stanford Univ. Press (1962)

    Google Scholar 

  5. Caucal, D.: On infinite graphs having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Carton, O., Thomas, W.: The monadic theory of morphic infinite words and generalizations. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 275–284. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Courcelle, B.: The monadic second-order logic of graphs IX: machines and their behaviours. Theor. Comput. Sci. 151, 125–162 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Carayol, A., Wöhrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112–123. Springer, Heidelberg (2003)

    Google Scholar 

  9. Courcelle, B., Walukiewicz, I.: Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Logic 92, 35–62 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symb. Logic 31, 169–181 (1966)

    Article  MATH  Google Scholar 

  11. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  12. Montanari, A., Puppis, G.: A contraction method to decide MSO theories of deterministic trees. In: Proc. 22nd IEEE Symposium on Logic in Computer Science (LICS), pp. 141–150

    Google Scholar 

  13. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. s2-30, 264–286 (1930)

    Article  Google Scholar 

  15. Rabinovich, A., Thomas, W.: Decidable theories of the ordering of natural numbers with unary predicates. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 562–574. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Semenov, A.: Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 162–175. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  17. Shelah, S.: The monadic theory of order. Ann. Math. 102, 379–419 (1975)

    Article  Google Scholar 

  18. Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275, 311–346 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, Lehrstuhl Informatik 7, 52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Kaminski Simone Martini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2008). Model Transformations in Decidability Proofs for Monadic Theories. In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87531-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87530-7

  • Online ISBN: 978-3-540-87531-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation