Skip to main content

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

The idea of solving problems in logic by first translating them to algebra, then using the powerful methodology of algebra for solving them, and then translating the solution back to logic, goes back to Leibnitz and Pascal. Papers on the history of Logic (e.g. Anellis-Houser [4], Maddux [14]) point out that this method was fruitfully applied in the 19th century not only to propositional logics but also to quantifier logics (De Morgan, Peirce etc. applied it to quantifier logics too). The number of applications grew ever since. (Though some of these remained unnoticed, e.g. the celebrated Kripke-Lemmon completeness theorem for modal logic w.r.t. Kripke models was first proved by Jónsson and Tarski in 1948 using algebraic logic.)

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

Access this chapter

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. Andréka, H. Monk, J.D. and Németi, I. (ed.s) Algebraic Logic. Proc. Conf. Budapest 1988, Colloq. Math. Soc. J. Bolyai vol. 54, North-Holland, Amsterdam, 1991; v+746 pp.

    Google Scholar 

  2. Andréka, H., Németi, I. and Sain, I. Abstract model theoretic approach to algebraic logic. Preprint (1984), updated in 1988, 1992; 70 pp.

    Google Scholar 

  3. Andréka, H., Németi, L, Sain, I. and Kurucz, A. Methodology for Applying Algebraic Logic to Logic. Lecture Notes, based on the 1991 Spring Semester of Logic Graduate School, Budapest 1993.

    Google Scholar 

  4. Anellis, I.H. and Houser, N. The nineteenth century roots of universal algebra and algebraic logic: A critical-bibliographical guide for the contemporary logician. In: Algebraic Logic (Proc. Conf. Budapest 1988), Colloq. Math. Soc. J. Bolyai vol. 54, North-Holland, Amsterdam, 1991; 1–36.

    MathSciNet  Google Scholar 

  5. van Benthem, J. Language in Action (Categories, Lambdas and Dynamic Logic). North-Holland, Amsterdam, 1991.

    Google Scholar 

  6. van Benthem, J. Dynamic Arrow Logic. Institute of Logic, Language and Computation, University of Amsterdam, preprint, 1992; To appear in Jan van Eick, Albert Visser (eds.) “Logic and Information Flow”, Kluwer, Dortrecht.

    Google Scholar 

  7. Blok, W.J. and Pigozzi, D. Algebraizable logics. Memoirs Amer. Math. Soc. vol. 77, 396, 1989; vi+78 pp.

    MathSciNet  Google Scholar 

  8. del Cerro, L.F., Gabbay, D., Herzig, A. and Ohlbach, H.J. Overview on the Current State of Translation Methods for Non-classical Logics. Preprint, Imperial College, 1993; 4 pp.

    Google Scholar 

  9. Czelakowski, J. Logic, algebras and consequence operators., Preprint, 1993; 79 pp.

    Google Scholar 

  10. Font, J.M. and Jansana, R. A general algebraic semantics for deductive systems. Preprint, Univ. of Barcelona, 1993.

    Google Scholar 

  11. Font, J.M. and Jansana, R. On the identity of the notions of strongly nice general logic and regularly algebraizable deductive system. Preprint, Univ. of Barcelona, 1993.

    Google Scholar 

  12. Henkin, L. Monk, J.D. and Tarski, A. Cylindric Algebras Part I and Part II. North-Holland, Amsterdam, 1985.

    Google Scholar 

  13. Henkin, L. and Tarski, A. Cylindric Algebras. Lattice Theory, Proc. of symposia in pure mathematics vol. 2, ed. R.P. Dilworth, Americal Mathematical Society, Providence 1961;83–113.

    MathSciNet  Google Scholar 

  14. Maddux, R. The origin of the calculus of relations. Studia Logica, 1991; vol. L, No 3/4: 421–456 pp.

    Google Scholar 

  15. “Possible worlds in Humanities, Arts and Sciences. W. de Gruyer, Berlin-New York, 1989; 450 pp.”

    Google Scholar 

  16. Roorda, D. Resource Logics. Proof-Theoretical Investigations. Ph.D. Dissertation, Institute for Logic, Language and Computation, Univ. of Amsterdam, 1991.

    Google Scholar 

  17. Sain, I. Is “Some-Other-Time” sometimes better than “Sometime” in proving partial correctness of programs? Studia Logica, 1988; vol. XLVII, No 3: 279–301.

    Article  MathSciNet  Google Scholar 

  18. Simon, A. Finite Schema Completeness for Typeless Logic and Repre-sentable Cylindric Algebras. Algebraic Logic (Proc. Conf. Budapest 1988) Colloq. Math. Soc. J. Bolyai vol 54, North-Holland, Amsterdam, 1991;665–670.

    Google Scholar 

  19. Venema, Y. Many-Dimensional Modal Logic. Ph.D. Dissertation, Institute for Logic, Language and Computation, Univ. of Amsterdam, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Andréka, H., Németi, I., Sain, I. (1994). Applying Algebraic Logic to Logic. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds) Algebraic Methodology and Software Technology (AMAST’93). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3227-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3227-1_3

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3227-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics