Skip to main content
SpringerLink
Log in

Cryptomorphisms at Work

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2004)

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

Included in the following conference series:

Abstract

We show that the category proposed in [5] of logic system presentations equipped with cryptomorphisms gives rise to a category of parchments that is both complete and translatable to the category of institutions, improving on previous work [15]. We argue that limits in this category of parchments constitute a very powerful mechanism for combining logics.

This work was partially supported by FCT and FEDER, namely, via the Project FibLog POCTI/MAT/37239/2001, and the QuantLog initiative of CLC.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blackburn, P., de Rijke, M.: Why combine logics? Studia Logica 59(1), 5–27 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Caleiro, C.: Combining Logics. PhD thesis, IST, TU Lisbon (2000)

    Google Scholar 

  3. Caleiro, C., Gouveia, P., Ramos, J.: Completeness results for fibred parchments: Beyond the propositional base. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 185–200. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Caleiro, C., Mateus, P., Ramos, J., Sernadas, A.: Combining logics: Parchments revisited. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, pp. 48–70. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Caleiro, C., Ramos, J.: Cryptofibring. In: Proceedings of CombLog 2004, Workshop on Combination of Logics: Theory and Applications, pp. 87–92 (2004), Extended abstract. Available at, http://wslc.math.ist.utl.pt/ftp/pub/CaleiroC/04-CR-fiblog25s.pdf

  6. del Cerro, L., Herzig, A.: Combining classical and intuitionistic logic. In: Frontiers of Combining Systems, pp. 93–102. Kluwer, Dordrecht (1996)

    Google Scholar 

  7. Gabbay, D.: Fibred semantics and the weaving of logics: part 1. Journal of Symbolic Logic 61(4), 1057–1120 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gabbay, D.: An overview of fibred semantics and the combination of logics. In: Frontiers of Combining Systems, pp. 1–55. Kluwer, Dordrecht (1996)

    Google Scholar 

  9. Gabbay, D.: Fibring Logics. Clarendon, Oxford (1999)

    MATH  Google Scholar 

  10. Goguen, J.: A categorical manifesto. Mathematical Structures in Computer Science 1, 49–67 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Goguen, J., Burstall, R.: A study in the foundations of programming methodology: specifications, institutions, charters and parchments. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 313–333. Springer, Heidelberg (1986)

    Google Scholar 

  12. Goguen, J., Burstall, R.: Institutions: abstract model theory for specification and programming. Journal of the ACM 39(1), 95–146 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mossakowski, T.: Using limits of parchments to systematically construct institutions of partial algebras. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 379–393. Springer, Heidelberg (1996)

    Google Scholar 

  14. Mossakowski, T., Tarlecki, A., Pawłowski, W.: Combining and representing logical systems. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol. 1290, pp. 177–196. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  15. Mossakowski, T., Tarlecki, A., Pawłowski, W.: Combining and representing logical systems using model-theoretic parchments. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 349–364. Springer, Heidelberg (1998)

    Google Scholar 

  16. Sernadas, A., Sernadas, C., Caleiro, C.: Fibring of logics as a categorial construction. Journal of Logic and Computation 9(2), 149–179 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sernadas, C., Rasga, J., Carnielli, W.: Modulated fibring and the collapsing problem. Journal of Symbolic Logic 67(4), 1541–1569 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  18. Tarlecki, A.: Moving between logical systems. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 478–502. Springer, Heidelberg (1996)

    Google Scholar 

  19. Tarlecki, A., Burstall, R., Goguen, J.: Some fundamental algebraic tools for the semantics of computation: Part 3. indexed categories. Theoretical Computer Science 91, 239–264 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  20. Wójcicki, R.: Theory of Logical Calculi. Kluwer, Dordrecht (1988)

    Google Scholar 

  21. Zanardo, A., Sernadas, A., Sernadas, C.: Fibring: Completeness preservation. Journal of Symbolic Logic 66(1), 414–439 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CLC – Departamento de Matemática, IST - UTL, Av. Rovisco Pais, 1049-001, Lisboa, Portugal

    Carlos Caleiro & Jaime Ramos

Authors
  1. Carlos Caleiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaime Ramos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    José Luiz Fiadeiro

  2. Department of Computer Science, Swansea University, UK

    Peter D. Mosses

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caleiro, C., Ramos, J. (2005). Cryptomorphisms at Work. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds) Recent Trends in Algebraic Development Techniques. WADT 2004. Lecture Notes in Computer Science, vol 3423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31959-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31959-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25327-3

  • Online ISBN: 978-3-540-31959-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation