Skip to main content
Log in

Fibring Non-Truth-Functional Logics: Completeness Preservation

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. This completeness transfer result, the second main contributionof the paper, generalizes the one established in Zanardo et al. (2001) butis obtained using new techniques that explore the properties of a suitablemeta-logic (conditional equational logic) where the (possibly)non-truth-functional valuations are specified. The modal paraconsistentlogic of da Costa and Carnielli (1988) is studied in the context of this novel notionof fibring and its completeness is so established.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Astesiano, E. and Cerioli, M., 1994, “Multiparadigm specification languages: A first attempt at foundations,” pp. 168–185 in Semantics of Specification Languages (SoSL'93), C.A. Middelburg, D.J. Andrews, and J.F. Groote, eds., Workshops in Computing, Berlin: Springer-Verlag.

  • Barr, M. and Wells, C., 1990, Category Theory for Computing Science, Englewood Cliffs, NJ: Prentice Hall.

    Google Scholar 

  • Beckert, B. and Gabbay, D., 1998, “Fibring semantic tableaux,” pp. 77–92 in Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, Tableaux'98, Proceedings, H. de Swart, ed., Lecture Notes in Artificial Intelligence, Vol. 1397, Berlin: Springer-Verlag.

    Google Scholar 

  • Béziau, J.-Y. and da Costa, N.C.A., 1994, “Théorie de la valuation,” Logique et Analyse 37, 95–117.

    Google Scholar 

  • Birkhoff, G., 1967, Lattice Theory, AMS Colloquium Publications, Providence, RI: American Mathematical Society.

    Google Scholar 

  • Blackburn, P. and de Rijke, M., 1997, “Why combine logics?,” Studia Logica 59, 5–27.

    Article  Google Scholar 

  • Carnielli, W. and Coniglio, M.E., 1999, “A categorial approach to the combination of logics,” Manuscrito 22, 69–94.

    Google Scholar 

  • Coniglio, M.E., Martins, A., Sernadas, A., and Sernadas, C., 2000, “Fibring (para) consistent logics,” Research Report, Section of Computer Science, Department of Mathematics, Instituto Superior Técnico, Lisbon, Extended abstract, Presented at II World Congress on Paraconsistency –WCP'2000.

    Google Scholar 

  • da Costa, N.C.A., 1963, “Sistemas formais inconsistentes,” Cathedra Thesis, UFPR, Brazil, Published by Editora UFPR in 1993.

    Google Scholar 

  • da Costa, N.C.A. and Alves, E., 1977, “A semantical analysis of the calculi Cn,” Notre Dame Journal of Formal Logic 18, 621–630.

    Google Scholar 

  • da Costa, N.C.A. and Carnielli, W., 1988, “Paraconsistent deontic logic,” Philosophia – The Philosophical Quarterly of Israel 16, 293–305.

    Google Scholar 

  • Deutsch, H., 1979, “The completeness of &,” Studia Logica 38, 137–147.

    Google Scholar 

  • Deutsch, H., 1984, “Paraconsistent analytic implication,” Journal of Philosophical Logic 13, 1–11.

    Google Scholar 

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

    Google Scholar 

  • Gabbay, D., 1996, “Fibred semantics and the weaving of logics: Part 1,” Journal of Symbolic Logic 61, 1057–1120.

    Google Scholar 

  • Gabbay, D., 1998, Fibring Logics, Oxford: Oxford University Press.

    Google Scholar 

  • Goguen, J. and Burstall, R., 1992, “Institutions: Abstract model theory for specification and programming,” Journal of the ACM 39, 95–146.

    Article  Google Scholar 

  • Goguen, J. and Meseguer, J., 1985, “Completeness of many-sorted equational logic,” Houston Journal of Mathematics 11, 307–334.

    Google Scholar 

  • Hughes, G. and Cresswell, M., 1996, A New Introduction to Modal Logic, London: Routledge.

    Google Scholar 

  • Lemmon, E. and Scott, E., 1977, The Lemmon Notes: An Introduction to Modal Logic, Oxford: Blackwell. Edited by K. Segerberg.

    Google Scholar 

  • Lewin, R., Mikenberg, I., and Schwarze, M., 1991, “C1 is not algebraizable,” Notre Dame Journal of Formal Logic 32, 609–611.

    Google Scholar 

  • Loparić, A. and Alves, E., 1980, “The semantics of the systems Cn of da Costa,” pp. 161–172 in Proceedings of the 3rd Brazilian Conference on Mathematical Logic, A. Arruda, N.C.A. da Costa, and A. Sette, eds., Sociedade Brasileira de Lógica.

  • MacLane, S., 1971, Categories for the Working Mathematician, Berlin: Springer-Verlag.

    Google Scholar 

  • Meseguer, J., 1998, “Membership algebra as a logical framework for equational specification,” pp. 18–61 in Recent Developments in Algebraic Development Techniques – Selected Papers, F. Parisi-Presicce, ed., Lecture Notes in Computer Science, Vol. 1376, Berlin: Springer-Verlag.

    Google Scholar 

  • Mortensen, C., 1980, “Every quotient algebra for C1 is trivial,” Notre Dame Journal of Formal Logic 21, 694–700.

    Google Scholar 

  • Puga, L., da Costa, N.C.A., and Carnielli, W., 1988, “Kantian and non-Kantian logics,” Logique et Analyse 31, 3–9.

    Google Scholar 

  • Rasga, J., Sernadas, A., Sernadas, C., and Viganò, L., 2002, “Fibring labelled deduction systems,” Journal of Logic and Computation 12, 443–473.

    Google Scholar 

  • Sannella, D. and Tarlecki, A., 1993, “Algebraic specification and formal methods for program development: What are the real problems?,” pp. 115–120 in Current Trends in Theoretical Computer Science, G. Rozenberg and A. Salomaa, eds., Essays and Tutorials, Singapore: World Scientific Press.

    Google Scholar 

  • Sernadas, A., Sernadas, C., and Caleiro, C., 1999, “Fibring of logics as a categorial construction,” Journal of Logic and Computation 9, 149–179.

    Google Scholar 

  • Sernadas, A., Sernadas, C., Caleiro, C., and Mossakowski, T., 2000, “Categorial fibring of logics with terms and binding operators,” pp. 295–316 in Frontiers of Combining Systems 2, D. Gabbay and M. de Rijke, eds., Research Studies Press.

  • Zanardo, A., Sernadas, A., and Sernadas, C., 2001, “Fibring: Completeness preservation,” Journal of Symbolic Logic 66, 414–439.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caleiro, C., Carnielli, W., Coniglio, M. et al. Fibring Non-Truth-Functional Logics: Completeness Preservation. Journal of Logic, Language and Information 12, 183–211 (2003). https://doi.org/10.1023/A:1022301711366

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022301711366

Navigation