Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2011: Theoretical Aspects of Computing – ICTAC 2011 pp 62–76Cite as

On Characterization, Definability and ω-Saturated Models

  • Conference paper

  • 421 Accesses

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

Abstract

Two important classic results about modal expressivity are the Characterization and Definability theorems. We develop a general theory for modal logics below first order (in terms of expressivity) which exposes the following result: Characterization and Definability theorems hold for every (reasonable) modal logic whose ω models have the Hennessy-Milner property. The results are presented in a general version which is relativized to classes of models.

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   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
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. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  2. Kamp, H.: Tense Logic and the Theory of Linear Order. PhD thesis, University of Califormia, Los Angeles (1968)

    Google Scholar 

  3. Goranko, V., Passy, S.: Using the universal modality: Gains and questions. Journal of Logic and Computation 2(1), 5–30 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. de Rijke, M.: The modal logic of inequality. Journal of Symbolic Logic 57, 566–584 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27(3), 333–354 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), 1–41 (2009)

    Article  MATH  Google Scholar 

  7. van Benthem, J.: Modal Correspondence Theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen (1976)

    Google Scholar 

  8. Chang, C.C., Keisler, H.J.: Model Theory. Studies in Logic and the Foundations of Mathematics, vol. 73. Elsevier Science B.V., Amsterdam (1973)

    MATH  Google Scholar 

  9. Kurtonina, N., de Rijke, M.: Simulating without negation. Journal of Logic and Computation 7, 503–524 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kurtonina, N., de Rijke, M.: Bisimulations for temporal logic. Journal of Logic, Language and Information 6, 403–425 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Keisler, H.J.: The ultraproduct construction. In: Proceedings of the Ultramath Conference, Pisa, Italy (2008)

    Google Scholar 

  12. Hansen, H.H.: Monotonic modal logics. Master’s thesis, ILLC, University of Amsterdam (2003)

    Google Scholar 

  13. Carreiro, F.: Characterization and definability in modal first-order fragments. Master’s thesis, Universidad de Buenos Aires (2010), arXiv:1011.4718

    Google Scholar 

  14. Areces, C., Figueira, D., Figueira, S., Mera, S.: Expressive power and decidability for memory logics. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS (LNAI), vol. 5110, pp. 56–68. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Areces, C., Figueira, D., Figueira, S., Mera, S.: The expressive power of memory logics. Review of Symbolic Logic (to appear)

    Google Scholar 

  16. Rosen, E.: Modal logic over finite structures. Journal of Logic, Language and Information 6, 95–27 (1995)

    Google Scholar 

  17. Kurtonina, N., de Rijke, M.: Classifying description logics. In: Brachman, R.J., Donini, F.M., Franconi, E., Horrocks, I., Levy, A.Y., Rousset, M.C. (eds.) Description Logics. URA-CNRS, vol. 410 (1997)

    Google Scholar 

  18. Otto, M.: Elementary proof of the van Benthem-Rosen characterisation theorem. Technical Report 2342, Department of Mathematics, Technische Universität Darmstadt (2004)

    Google Scholar 

  19. Hollenberg, M.: Logic and Bisimulation. PhD thesis, Philosophical Institute, Utrecht University (1998)

    Google Scholar 

  20. Areces, C., Gorín, D.: Coinductive models and normal forms for modal logics. Journal of Applied Logic (2010) (to appear)

    Google Scholar 

  21. Blackburn, P., van Benthem, J., Wolter, F.: Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol. 3. Elsevier Science Inc., New York (2006)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dto. de Computación, FCEyN, Universidad de Buenos Aires, Argentina

    Facundo Carreiro

Authors
  1. Facundo Carreiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute for Software Technology, The United Nations University, Casa Silva Mendes, Est. do Engenheiro Trigo No. 4, Macau, China

    Antonio Cerone

  2. Data Abstraction (Pty) Ltd, 7 Saint David’s Park, Saint David’s Place, Parktown, Johannesburg, South Africa

    Pekka Pihlajasaari

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carreiro, F. (2011). On Characterization, Definability and ω-Saturated Models. In: Cerone, A., Pihlajasaari, P. (eds) Theoretical Aspects of Computing – ICTAC 2011. ICTAC 2011. Lecture Notes in Computer Science, vol 6916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23283-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23283-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23282-4

  • Online ISBN: 978-3-642-23283-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation