Skip to main content
SpringerLink
Log in

On the Algebraizability of Annotated Logics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Annotated logics were introduced by V.S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not structural, i.e., their consequence relations are not closed under substitutions. In this paper we give systems of annotated logics that are equivalent to those of Subrahmanian in the sense that everything provable in one type of system has a translation that is provable in the other. Moreover these new systems are structural. We prove that these systems are weakly congruential, namely, they have an infinite system of congruence 1-formulas. Moreover, we prove that an annotated logic is algebraizable (i.e., it has a finite system of congruence formulas,) if and only if the lattice of annotation constants is finite.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abe, J. M., 1992, Fundamentos da Lógica Anotada, Ph.D. Thesis. University of São Paul, São Paulo.

    Google Scholar 

  2. Blair, H. A. and Subrahmanian, V. S., 1989, Paraconsistent Logic Programming, Theoretical Computer Science 68, 135–154.

    Google Scholar 

  3. Blok, W. J. and Pigozzi, D., 1989, Algebraizable Logics, Memoirs of the A.M.S. 77,Nr. 396.

  4. W.J. Blok, D. Pigozzi, 1992. Algebraic Semantics for Universal Horn Logic without Equality, in A. Romanowska, J. D. H. Smith (eds.), Universal Algebra and Quasigroup Theory, Heldermann, Berlin, 1–56.

    Google Scholar 

  5. da Costa, N. C. A., Subrahmanian, V. S. and Vago, C., 1991, The Paraconsistent Logics Pτ, Zeitschrift fur Math. Logic 37, 139–148.

    Google Scholar 

  6. Czelakowski, J., 1981, Equivalential logics I, II, Studia Logica 40, 227–236, 335–372.

    Google Scholar 

  7. Font, J. and Jansana, R., 1993, A General Algebraic Semantics for Deductive Systems, Preprint. University of Barcelona.

  8. Herrmann, B., 1993, Equivalential Logics and Definability of Truth, Ph.D. Thesis, Freie Universität Berlin, 61 pp.

  9. Subrahmanian, V. S., 1987, On the Semantics of Quantitative Logic Programs, in Proceedings of the 4th IEEE Symposium on Logic Programming, Computer Society Press, Washington D.C., 173–182.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Matemáticas, Pontificia Universidad Católica de Chile, Casilla 306, Correo 22, Santiago, Chile

    Renato A. Lewin, Irene F. Mikenberg & María G. Schwarze

Authors
  1. Renato A. Lewin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irene F. Mikenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. María G. Schwarze
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lewin, R.A., Mikenberg, I.F. & Schwarze, M.G. On the Algebraizability of Annotated Logics. Studia Logica 59, 359–386 (1997). https://doi.org/10.1023/A:1005036412368

Download citation

  • Issue Date:

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

Search

Navigation