Skip to main content

Synchronization of logics with mixed rules: Completeness preservation

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1349))

Abstract

Several mechanisms for combining logics have appeared in the literature. Synchronization is one of the simplest: the language of the combined logic is the disjoint union of the given languages, but the class of models of the resulting logic is a subset of the cartesian product of the given classes of models (the interaction between the two logics is imposed by constraining the class of pairs of models). Herein, we give both a model-theoretic and a proof-theoretic account of synchronization as a categorial construction (using coproducts and cocartesian liftings). We also prove that soundness is preserved by possibly constrained synchronization and state sufficient conditions for preservation of model existence and strong completeness. We provide an application to the combination of dynamic logic and linear temporal logic.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Arrais and J. Fiadeiro. Unifying theories in different institutions. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specification, pages 81–101. Springer-Verlag, LNCS 1130, 1996.

    Google Scholar 

  2. P. Blackburn and M. de Rijke. Why combine logics. Studia Logica, 58, 1997. In print.

    Google Scholar 

  3. M. Cerioli and J. Meseguer. May I borrow your logic? (Transporting logical structures along maps). Theoretical Computer Science, 173:311–347, 1997.

    Google Scholar 

  4. M. Finger and D. Gabbay. Adding a temporal dimension to a logic system. Journal of Logic, Language and Information, 1:203–233, 1992.

    Google Scholar 

  5. M. Finger and D. Gabbay. Combining temporal logic systems. Notre Dame Journal of Formal Logic, 37:204–232, 1996.

    Google Scholar 

  6. D. Gabbay. An overview of fibred semantics and the combination of logics. In F. Baader and K. Schulz, editors, Frontiers of Combining Systems, pages 1–55. Kluwer Academic Publishers, 1996.

    Google Scholar 

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

    Google Scholar 

  8. R. Goldblatt. Logics of Time and Computation. CSLI, 1992. Second edition.

    Google Scholar 

  9. D. Harel. Dynamic logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, vol II, pages 497–604. Kluwer, 1984.

    Google Scholar 

  10. M. Kracht and F. Wolter. Properties of independently axiomatizable bimodal logics. Journal of Symbolic Logic, 56(4):1469–1485, 1991.

    Google Scholar 

  11. A. Sernadas, C. Sernadas, and C. Caleiro. Fibring of logics as a categorial construction. Research report, Section of Computer Science, Department of Mathematics, Instituto Superior Técnico, 1096 Lisboa, Portugal, 1997. Submitted for publication.

    Google Scholar 

  12. A. Sernadas, C. Sernadas, and C. Caleiro. Synchronization of logics. Studia Logica, 58, 1997. In print.

    Google Scholar 

  13. A. Tarlecki. Moving between logical systems. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specification, pages 478–502. Springer-Verlag, LNCS 1130, 1996.

    Google Scholar 

  14. R. Thomason. Combinations of tense and modality. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic II, pages 135–165. Kluwer Academic Publishers, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael Johnson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sernadas, A., Sernadas, C., Caleiro, C. (1997). Synchronization of logics with mixed rules: Completeness preservation. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000490

Download citation

  • DOI: https://doi.org/10.1007/BFb0000490

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63888-9

  • Online ISBN: 978-3-540-69661-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics