Skip to main content
SpringerLink
Log in

Algebraization of quantifier logics, an introductory overview

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In some directions we tried to give an overview of the most recent results and research trends, too.

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. Adamek,J. Herrlich,H. and Strecker,G., Abstract and concrete categories, or the joy of cats, John Wiley and Sons (1990).

  2. Andréka,H., Algebraic investigation of first-order logic (in Hungarian), Dissertation with Eötvös Loránd Univ. Budapest (1973), ix+162 pp.

  3. Andréka,H., Universal Algebraic Logic (in Hungarian), Dissertation with Hung. Acad. Sci. Budapest (1977), 199 pp.

  4. Andréka,H., On the union — relation composition reducts of relation algebras, Abstracts of Amer. Math. Soc. Issue 62 Vol 10,2 (March 1989), p.174 (*89T-08-21).

    Google Scholar 

  5. Andréka,H., On the representation problem of distributive semilattice-ordered semigroups. (Extended version), Preprint, Math. Inst. Hungar. Acad. Sci., Budapest, 1989.

    Google Scholar 

  6. Andréka,H., Weakly representable but not representable relation algebras, Preprint, Math. Inst. Hungar. Acad. Sci., Budapest, No. 55/1990 (1990).

  7. Andréka,H., The equational theories of representable positive cylindric and relation algebras are decidable, Preprint, Math. Inst. Hungar. Acad. Sci., Budapest (1990).

    Google Scholar 

  8. Andréka,H., Complexity of the equations valid in algebras of relations, Thesis for D. Sc. (a post-habilitation degree) with Hungar. Acad. Sci., Budapest (1991).

    Google Scholar 

  9. Andréka,H. Comer,S.D. and Németi,I., Epimorphisms in cylindric algebras, Manuscript (1983).

  10. Andréka,H. Gergely,T. and Németi,I., Purely algebraical construction of first order logics, Publications of Central Res. Inst. Physics Budapest KFKI-73-71 (1973), 46pp.

  11. Andréka,H. Gergely,T. and Németi,I., Many-sorted languages and their connections with higher-order languages (in Russian), Kibernetika (Kijev) Vol 75/4 (1975), 86–92.

    Google Scholar 

  12. Andréka,H. Gergely,T. and Németi,I., On some questions of languages of order n (in Hungarian), Matematikai Lapok Vol 24 (1975), 63–94.

    Google Scholar 

  13. Andréka,H. Gergely,T. and Németi,I., On universal algebraic construction of logics, Studia Logica Vol 36 (1977), 9–47.

    Google Scholar 

  14. Andréka,H. Givant,S. and Németi,I., The lattice of varieties of representable algebras, Preprint (1990), Submitted.

  15. Andréka,H. Guessarian,I. and Németi,I., A unifying theorem for algebraic semantics and dynamic logics, Information and Computation Vol 72,1 (1987), 31–45.

    Google Scholar 

  16. Andréka,H. Jónsson,B. and Németi,I., Free algebras in discriminator varieties, Algebra Universalis, Vol 29 (1991), 401–447. Abstracted in [BMP], 1–14 (1990).

    Google Scholar 

  17. Andréka,H. Jónsson,B. and Németi,I., Bibliography on Boolean algebras with operator's (in preparation).

  18. 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 

  19. Andreá,H. and Németi,I., A simple purely algebraic proof of the completeness of some first order logics, Algebra Universalis Vol 5 (1975), 8–15.

    Google Scholar 

  20. Andréka,H. and Németi,I., Generalization of variety and quasivariety concepts to partial algebras through category theory, Dissertationes Mathematicae (Rozprawy Math.) PWN Polish Scientific Publisher, Warsaw, Poland Vol CCIV (1982), 1–56.

  21. Andréka,H. and Németi,I., On systems of varieties definable by schemes of equations, Algebra Universalis Vol 11 (1980), 105–116.

    Google Scholar 

  22. Andréka,H. and Németi,I., Applications of universal algebra, algebraic logic etc. in Computer Science Parts I–V, Preprints, Math. Inst. Hungar. Acad. Sci., Budapest (partially published at various places) (1977–1986).

    Google Scholar 

  23. Andréka,H. and Németi,I., Relational algebraic conditions for representability of cylindric and polyadic algebras, Preprint, Math. List. Hungar. Acad. Sci., Budapest, 1988 (submitted), 46pp.

    Google Scholar 

  24. Andréka,H. Németi,I. and Sain,I., Abstract model theoretic approach to algebraic logic, Manuscript (1984), 70pp.

  25. Andréka,H. Németi,I. and Thompson,R.J., Weak cylindric set algebras and weak subdirect indecomposability, J. Symbolic Logic Vol 55, No 2 (June 1990), 577–588.

    Google Scholar 

  26. Andreá,H. and Sain,I., Connections between initial algebra semantics of CF languages and algebraic logic, Mathematical Logic in Computer Science (Proc. Conf. Salgótarján Hungary 1978) (Ed.s: Dömölki,B. and Gergely,T.) Colloq. Math. Soc. J. Bolyai Vol 26, North-Holland, Amsterdam (1981), 25–83.

  27. Andréka,H. Thompson,R.J., A Stone-type representation theorem for algebras of relations of higher rank, Trans. Amer. Math. Soc. Vol 309,2 (Oct. 1988), 671–682.

    Google Scholar 

  28. Andréka,H. and Tuza,Zs., Nonfinite axiomatizability of the polyadic operations in algebraic logic, Abstracts of Amer. Math. Soc. Vol 9,6, Issue 60 (Nov. 1988), 500 (*88T-03-264).

    Google Scholar 

  29. Anéllis,I.H. and Houser,N., The nineteenth century roots of universal algebra and algebraic logic: A critical-bibliographical guide for the comtemporary logician, In [AMN]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), 1–36.

    Google Scholar 

  30. Barthelemy,J.-P., Syntaxes et catégories monadiques, C. R. Acad. Sci. Paris Vol 278 (1974), 199–202.

    Google Scholar 

  31. Barwise,J., Admissible Sets and Structures., Perspectives in Mathematical Logic, Springer-Verlag, Berlin (1975).

    Google Scholar 

  32. Bacon,J., The completeness of a predicate-functor logic, Journal of Symbolic Logic Vol 50 (1985), 903–926.

    Google Scholar 

  33. Barwise,J. and Feferman,S. (ed.s), Model-Theoretic Logics, Springer-Verlag, Berlin (1985).

    Google Scholar 

  34. Bednarek,A.R. and Ulam,S.M., Some remarks on relational composition in computational theory and practice, Fundamentals of Computation Theory'77, Lecture Notes in Computer Science Vol 56, Springer-Verlag, Berlin (1977), 33–38.

    Google Scholar 

  35. Bell,J.L. and Slomson,A.B., Models and Ultraproducts, North-Holland, Amsterdam (1969).

    Google Scholar 

  36. van Benthem,J., Semantic Parallels in Natural Language and Computation, Institute for Language, Logic and Information, University of Amsterdam (1988), 53pp.

  37. van Benthem,J., Language in Action, (Categories, Lambdas and Dynamic Logic), North-Holland (Studies in Logic ... Vol 130) (1991), x+350 pp.

  38. van Benthem,J., Modal logic and relational algebra, Preprint, Institute for Language, Logic and Information, University of Amsterdam, Proc. Malcev Conference, Inst. Math. USSR, Academy of Sciences, Novsibirsk, to appear (1989).

  39. van Benthem,J., General dynamics, Report LP-90-11, Institute for Language, Logic and Information, University of Amsterdam, to appear in Theoretical Linguistics (1990).

  40. van Benthem,J., Modal logic as a theory of information, Proc. Prior Memorial Colloquium, Christchurch, New Zealand, 1989, Oxford University Press (to appear).

  41. Berghammer,R. Kempf,P. Schmidt,G. and Ströhlein,T., Relation algebra and logic of programs, In [AMN]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), 37–58.

    Google Scholar 

  42. Bergman,C.H. Maddux,R.D. and Pigozzi,D.L. (eds.), Algebraic Logic and Universal Algebra in Computer Science, Lecture Notes in Computer Science, Springer Verlag Vol 425 (1990), xi+292 p.

  43. Bernardi,C. and D'Aquino,P., Topological duality for diagonalizable algebras, Notre Dame J. Formal Logic Vol 29,3 (1988), 345–364.

    Google Scholar 

  44. Bernarducci,A., The interpretability logic of Peano arithmetic, Dissertation, University of California, Berkeley (1989).

    Google Scholar 

  45. Bernarducci,A., ▪n/0-interpretations of modal logic, Bolletino della Unione Matematica Italiana (to appear).

  46. Bernays,P., Über eine natürliche Erweiterung des Relationenkalküls, Constructivity in mathematics (Proc. Coll. Amsterdam 1957) (ed. Heyting,A.), North-Holland, Amsterdam (1959), 1–14.

    Google Scholar 

  47. Biró, B., Non-finite-axiomatizability results in algebraic logic, J. of Symbolic Logic, Vol 57,2 (1992).

  48. Biró,B. and Shelah,S., Isomorphic but not lower-base-isomorphic cylindric set algebras, J. of Symbolic Logic Vol 53, No 3 (Sept. 1988), 846–853.

    Google Scholar 

  49. Blok,W.J., Varieties of interior algebras, Dissertation, University of Amsterdam (1976).

  50. Blok,W.J., The lattice of varieties of modal algebras is not strongly atomic, Algebra Universalis Vol 11 (1980), 150–194.

    Google Scholar 

  51. Blok,W.J., The lattice of modal logics: An algebraic investigation, J. Symbolic Logic Vol 45 (1980), 221–238.

    Google Scholar 

  52. Blok,W.J. and Pigozzi,D., Alfred Tarski's work on general metamathematics, J. Symbolic Logic Vol 53, 1 (1988), 36–48.

    Google Scholar 

  53. Blok,W.J. and Pigozzi,D., Algebraizable logics, Memoirs Amer. Math. Soc. Vol 77, 396 (1989), vi+78 pp.

    Google Scholar 

  54. Blok,W.J. and Pigozzi,D., On the structure of varieties with equationally definable principal congruences, Part III, Preprint, 1989.

  55. Blok,W.J. and Pigozzi,D., On the structure of varieties with equationally definable principal congruences, Part IV, Preprint, 1989.

  56. Blok,W.J. and Pigozzi,D., The deduction theorem in algebraic logic, Preprint, 1989.

  57. Blok,W.J. and Pigozzi,D., Local Deduction Theorems in Algebraic Logic, In [AMN]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), 75–109.

    Google Scholar 

  58. Börner,F., Operationen auf Relationen, Dissertation Dr. rer. nat., Karl-Marx-Universität Leipzig (1988).

  59. Bloom,S.L. and Brown,D.J., Classical abstract logics, Dissertationes Mathematicae (Rozprawy Matematyczne) Vol CII (1973), 43–56.

    Google Scholar 

  60. Bredikhin,D.A., Abstract characteristics of some relation algebras (in Russian), Algebra and Theory of Numbers (Nalchik) Vol 2 (1977), 3–19.

    Google Scholar 

  61. Bredikhin,D.A., Multiplicative algebra of relations (in Russian), Dissertation, Saratov State University, Saratov, USSR (1977).

    Google Scholar 

  62. Brink,C., R ⌉-Algebras and R ⌉-Model Structures as Power Constructs, Studia Logica Vol XLVIII, 1 (1988), 85–109.

    Google Scholar 

  63. Brown,D.J. and Suszko,R., Abstract logics, Dissertationes Mathematicae (Rozprawy Matematyczne) Vol CII (1973), 9–41.

    Google Scholar 

  64. Burmeister,P., A Model Theoretic Oriented Approach to Partial Algebras, Akademie-Verlag, Berlin (1986).

    Google Scholar 

  65. Burris,S. and Sankappanavar,H.P., A course in universal algebra, Graduate Texts in Mathematics, Springer-Verlag, New York (1981).

    Google Scholar 

  66. Catach,L., Normal multimodal logics, Proc. 7th Nat. Conf. on AI (AAAI'88) St. Paul, Minnesota (1988), 491-495.

  67. Cirulis,J., An abstract description of data types and of varieties of data algebras (in Russian), Algebra and Discrete Mathematics, Latvian University, Riga (1986), 131–144.

    Google Scholar 

  68. Cirulis,J., Generalizing the notion of polyadic algebra, Bull. Section of Logic Vol 15,1 (1986), 2–9.

    Google Scholar 

  69. Cirulis,J., Two generalizations of the notion of a polyadic algebra. (In Russian.), Izv. Vyss. Uchebn. Zaved. Mat., No 12 (1988), 39–49.

  70. Cirulis,J., Relational algebras in databases and generalized cylindric algebras. (In Russian.), Theoretical Questions of Programming, Latvian University, Riga (1988), 100–107.

    Google Scholar 

  71. Cirulis,J., An algebraization of first-order logic with terms, In [AMN]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), 125–146.

    Google Scholar 

  72. Cohn,P.M., Universal Algebra, Harper and Row, New York (1965).

    Google Scholar 

  73. Comer,S.D., A sheaf-theoretic duality for cylindric algebras, Trans. Amer. Math. Soc. Vol 169 (1972), 75–87.

    Google Scholar 

  74. Comer,S.D., Galois-theory of cylindric algebras and its applications, Trans. Amer. Math. Soc. Vol 286 (1984), 771–785.

    Google Scholar 

  75. Comer,S.D., The representation of dimension three cylindric algebras, In [AMN]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), 147–172.

    Google Scholar 

  76. Comer,S.D., A remark on representable positive cylindric algebras, Algebra Universalis Vol 28 (1991), 150–151.

    Google Scholar 

  77. Cosmadakis,S.S., Database theory and cylindric lattices (extended abstract), Foundations of Computer Science (Proc. Conf. 1987), IEEE Computer Soc.

  78. Craig,W., Logic in Algebraic Form, North-Holland, Amsterdam (1974), viii+204pp.

    Google Scholar 

  79. Craig,W., Unification and abstraction in algebraic logic, Studies in Algebraic Logic, Math. Assoc. Amer. (1974), 6–57.

  80. Craig,W., Near-equational and equational systems of logic for partial functions, J. Symbolic Logic Vol 54 (1989), 795–827, 1181–1215.

    Google Scholar 

  81. Craig,W. and Vaught,R.L., Finite axiomatizability using additional predicates, J. of Symbolic Logic Vol 23,2 (1958), 289–308.

    Google Scholar 

  82. Czelakowski,J., A purely algebraic proof of the omitting types theorem, Bull. Section of Logic Vol 8,1 (1979), 7–9.

    Google Scholar 

  83. Daigneault,A., On automorphisms of polyadic algebras, Trans. Amer. Math. Soc. Vol 112 (1964), 84–130.

    Google Scholar 

  84. Daigneault,A., Théorie des modéles en logique mathématique, 2-éme éd. Montreal (1967), 136pp.

  85. Daigneault,A., Lawvere's elementary theories and polyadic and cylindric algebras, Fund. Math. Vol 66 (1969), 307–328.

    Google Scholar 

  86. Daigneault. A. and Monk,J.D., Representation theory for polyadic algebras, Fund.Math. Vol 52 (1963), 151–176.

    Google Scholar 

  87. Demaree,D., Copeland algebras, J. Symbolic Logic Vol 37 (1972), 646–656.

    Google Scholar 

  88. De Morgan,A., On the syllogism, no. IV, and on the logic of relations, Transactions of the Cambridge Philosophical Society Vol 10 (1964), 331–358.

    Google Scholar 

  89. Dipert,R., Peírce, Frege, the logic of relations, and Church's theorem, History and Philosophy of Logic Vol 5 (1984), 49–66.

    Google Scholar 

  90. Driessel,K., Significance and invariance in mathematical structures, Doctoral Dissertation, Oregon State University (1968), vii+80pp.

  91. Došen,K., Second-order logic without variables, In: Categorial Grammar (eds: W. Buszkowski, W. Marciszewski and J. van Benthem) Linguistic & Literary Studies in Eastern Europe, Amsterdam (1988), 245–264.

    Google Scholar 

  92. Düntsch,I., Cylindric algebras and Codd's relational model of data (Part I), Preprint, University of Brunei, Darussalam, Negara Brunei, Dept. Math., Dec. 1989.

  93. Ehrig,H. and Mahr,B., Fundamentals of algebraic specification 1, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1985).

    Google Scholar 

  94. Feldman,N., Cylindric algebras with terms, J. Symbolic Logic Vol 55, 2 (1990), 865–866.

    Google Scholar 

  95. Ferenczi,M., On inducing homomorphisms between relation set algebras, Algebra Universalis Vol 27, No 4 (1990), 474–479.

    Google Scholar 

  96. Ferenczi,M., Measures defined on free products of formula algebras and analogies with cylindric homomorphisms, In [AMN]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), 173–181.

    Google Scholar 

  97. Font,J.M., On some congruence lattices of a topological Heyting lattice, In: Contributions to General Algebra 5 (J. Czermak et al., editors), Verlag HölderPichler-Tempski, Wien, and Teubner, Stuttgart (1987), 129–137.

    Google Scholar 

  98. Font,J.M. and Verdú,V., A first approach to abstract modal logics, J. Symbolic Logic Vol 54, No 3 (1989), 1042–1062.

    Google Scholar 

  99. Font,J.M. and Verdú,V., On some non-algebraizable logics, In [AMN]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), 183–188.

    Google Scholar 

  100. Font,J.M. and Verdú,V., Abstract logics related to classical conjunction and disjunction, Studia Logica (to appear).

  101. Freeman,J., Algebraic semantics for modal predicate logic, Z. Math. Logik Grundl. Math. Vol 22 (1976), 523–552.

    Google Scholar 

  102. Freyd,P.J. and Scedrov,A., Categories, Allegories, North-Holland (1990), xviii-294 pp.

  103. Gargov,G. and Passy,S., A note on Boolean modal logic, In: Mathematical Logic (ed. P.Petrov), Proc. of the 1988 Summer School & Conference dedicated to Arend Heyting, Chaika, Bulgaria, Plenum Press (New York & London) (to appear).

  104. Geiger,D., Algebras of binary relations, Preprint, 1987.

  105. Georgescu,G., The theory of categories and mathematical logic, Gaz.Mat. Ser.A. Vol 78 (1973), 121–125.

    Google Scholar 

  106. Georgescu,G., Modal polyadic algebras, Bull. Math. Soc. Math. R.S. Roumanie (N.S.) Vol 23 (1979), 49–64.

    Google Scholar 

  107. Georgescu,G., A representation theorem for tense polyadic algebras, Mathematica (Cluj) Vol 21 (1979), 131–138.

    Google Scholar 

  108. Georgescu,G., Monotone quantifiers on polyadic algebras, Stud. Cerc. Mat. Vol 34 (1982), 125–145.

    Google Scholar 

  109. Georgescu,G., Algebraic analysis of the topological logic L(I), Z. Math. Logik Grundl. Math. Vol 28 (1982), 447–454.

    Google Scholar 

  110. Gergely,T., Algebraic representation of language hierarchies, Acta Cybernetica Vol 5 (1980), 307–323.

    Google Scholar 

  111. Givant,S., Locally small relation algebras, Abstracts of AMS (1988).

  112. Givant,S., Tarski's development of logic and mathematics based on the calculus of relations, In [AMN]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), 189–215.

    Google Scholar 

  113. Givant,S., Relation algebras generated by relativized subalgebras, Abstracts of AMS (1989).

  114. Givant,S. Andréka,H. and Németi,I., Essentially infinite varieties of relation algebras, Abstracts of AMS Vol 11, Issue 67, No 2, 90-08-45 (1990).

  115. Goldblatt,R.I, Metamathematics of modal logic. Parts I–II, In: Reports on Mathematical Logic Vol 6–7 (1976), 41–78 and 21–52.

    Google Scholar 

  116. Goldblatt,R.I., An algebraic study of well-foundedness, Studia Logica Vol XLIV/4 (1985), 423–438.

    Google Scholar 

  117. Goldblatt,R.I., Logics of Time and Computation, CSLI Lecture Notes No. 7, Stanford (1987).

  118. Goldblatt,R.I, Varieties of complex algebras, Annals of Pure and Appl. Logic Vol 44 (1990), 173–242.

    Google Scholar 

  119. Goldblatt,R.I., On closure under canonical embedding algebras, In [AMN]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), 217–229.

    Google Scholar 

  120. Goranko,V., The Craig Interpolation Theorem for Prepositional Logics with Strong Negation, Studia Logica Vol XLIV, No 3 (1985), 291–317.

    Google Scholar 

  121. Goranko,V., Modal definability in enriched languages, Notre Dame J. Formal Logic Vol 31, No 1 (1990), 81–105.

    Google Scholar 

  122. Goranko,V. and Passy,S., Using the universal modality: Profits and questions, Preprint of Sector of Logic, Faculty of Math., Sofia University, 1989.

  123. Guesgen,H.W. and Ladkin,P.B., An algebraic approach to general Boolean constraint problems, Kestrel Institute (Febr. 1990), 1–15.

  124. Halmos,P.R., Polyadic Boolean algebras, Proc. Nat. Acad. Sci. U.S.A. Vol 40 (1954), 296–301.

    Google Scholar 

  125. Halmos,P.R., Polyadic algebras, Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, second edition, Communications Research Division, Institute for Defense Analyses (1960), 252–255.

  126. Halmos,P.R., Algebraic Logic, Chelsea Publ. Co., New York (1962), 271pp.

    Google Scholar 

  127. Halmos,P.R., I Want to be a Mathematician. An Automathography, Springer-Verlag, Berlin (1985).

    Google Scholar 

  128. Henkin,L., Extending Boolean operations, Pac. J. Math. Vol 22 (1970), 723–752.

    Google Scholar 

  129. Henkin,L. and Monk,J.D., Cylindric algebras and related structures, Proc. Tarski Symp., Amer. Math. Soc. Vol 25 (1974), 105–121.

    Google Scholar 

  130. Henkin,L. Monk,J.D. and Tarski,A., Cylindric Algebras Part I, North-Holland, Amsterdam (1971 and 1985).

    Google Scholar 

  131. Henkin,L. Monk,J.D. and Tarski,A., Cylindric Algebras Part II, North-Holland, Amsterdam (1985).

    Google Scholar 

  132. Henkin,L. Monk,J.D. Tarski,A. Andréka,H. and Németi,I., Cylindric Set Algebras, Lecture Notes in Mathematics Vol 883, Springer-Verlag, Berlin (1981), vi+323pp.

    Google Scholar 

  133. Hennessey,M., A proof system for the first-order relational calculus, J. Computer and System Sciences Vol 20 (1980), 96–110.

    Google Scholar 

  134. Hoare,C.A.R. and Jifeng,He., The weakest prespecification, Part II, Fundamenta Informaticae Vol 9 (1986), 217–252.

    Google Scholar 

  135. Howard,C.M., An approach to algebraic logic, Doctoral Dissertation, University of California, Berkeley (1965), 83pp.

    Google Scholar 

  136. Howorka,E., Generators for algebras of relations, Notices of the Amer. Math. Soc. Vol 24 (1977), A-4, A-5.

    Google Scholar 

  137. Imieliński,R. and Lipski,W., The relational model of data and cylindric algebras, J. Computer and System Sciences Vol 28 (1984), 80–103.

    Google Scholar 

  138. Immerman,N. and Kozen,D., Definability with bounded number of variables, Proc. IEEE (1987), 891–939.

  139. Johnson,J.S., Nonfinitizability of classes of representable polyadic algebras J. Symbolic Logic Vol 34 (1969), 344–352.

    Google Scholar 

  140. Johnson,J.S., Axiom systems for logic with finitely many variables, J. Symbolic Logic Vol 38 (1973), 576–578.

    Google Scholar 

  141. Jónsson,B., Varieties of relation algebras, Algebra Universalis Vol 15 (1982), 273–298.

    Google Scholar 

  142. Jónsson,B., The theory of binary relations, In [AMN]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), 245–292.

    Google Scholar 

  143. Jónsson,B., Maximal algebras of binary relations, In: Contributions to Group Theory: Papers published in honor of Roger Lyndon on his sixty-fifth birthday, Contemporary Mathematics, Amer. Math. Soc., Providence Vol 33 (1984), 299–307.

    Google Scholar 

  144. Jónsson,B., On binary relations, In: Proceedings of the NIH Conference on Universal Algebra and Lattice Theory, (G. Hutchinson, ed.), Laboratory of Computer Research and Technology, National Institute of Health, Bethesda, Maryland (1986), 2–5.

    Google Scholar 

  145. Jónsson,B., Relation algebras and Schröder categories, Discrete Mathematics Vol 70 (1988), 27–45.

    Google Scholar 

  146. Jónsson,B., Program specification algebras, Manuscript (1989).

  147. Jónsson,B., Program specification as Boolean operators, Preprint, Vanderbilt University, Dept. Math. (circulated at the Jónsson Conference, Iceland, 1990) (1990).

  148. Jónsson,B. and Tarski,A., Boolean algebras with operators, Bulletin of the Amer. Math. Soc. Vol 54 (1948), 79–80.

    Google Scholar 

  149. Jónsson,B. and Tarski,A., Boolean algebras with operators. Parts I–II, Amer. J. Math. Vol 73, 74 (1951, 1952), 891–939, 127–162.

    Google Scholar 

  150. Issue devoted to papers on the work of A.Tarski, J. Symbolic Logic Vol 61,4 (1986).

  151. Keisler,H.J., A complete first-order logic with infinitary predicates, Fund. Math. Vol 52 (1963), 177–203.

    Google Scholar 

  152. Kozen,D., On Kleene algebras and closed semirings, In: Proc. Math. Found. Comp. Sci. 1990, Lecture Notes in Computer Science, Springer Verlag Vol 452 (1990), 26–47.

  153. Knuth.E. and Rónyai,L., Closed convex reference schemes. (A junction between computer science, cylindric- and partial algebras.), Proc. IFIP Conf., Hungary (1983).

  154. Kramer,R., Relativized relation algebras, In [AMN]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), 193–349.

    Google Scholar 

  155. Kuhn,S.T., Quantifiers as modal operators, Studia Logica Vol 39 (1980), 145–158.

    Google Scholar 

  156. Kuhn,S.T., An axiomatization of predicate functor logic, Notre Dame Journal of Formal Logic Vol 24 (1983), 233–241.

    Google Scholar 

  157. Ladkin,P.B., The logic of time representation, Dissertation, Univ. of California, Berkeley, 1987. Also: Technical Report KSE. U-87-13, Kestrel Institute, Palo Alto.

    Google Scholar 

  158. Ladkin,P.B. and Maddux,R.D., Representation and reasoning with convex time intervals, Technical Report KES. U-88-2 (1988).

  159. Ladkin,P.B. and Maddux,R.D., The algebra of constraint satisfaction problems and temporal reasoning, Preprint (1989).

  160. Laita,L., A study of algebraic logic from the point of view of category theory, Notre Dame J. Formal Logic Vol 17 (1975), 89–118.

    Google Scholar 

  161. LeBlanc,L., Non-homogeneous and higher order polyadic algebras, Doctoral Dissertation, University of Chicago (1959), 81pp.

  162. Leblanc,L., Nonhomogeneous polyadic algebras, Proc. Amer. Math. Soc. Vol 13 (1962), 59–65.

    Google Scholar 

  163. Lucas,Th., Sur l'équivalence des algébres cylindriques, Bull. Soc. Math. Belg. Vol 20 (1968), 236–263.

    Google Scholar 

  164. Lugowski,H., Grundzüge der Universellen Algebra, Teubner-Texte zur Mathematik, Leipzig (1976), 238pp.

    Google Scholar 

  165. Lyndon,R.C., The representation of relation algebras, II, Ann. of Math. series 2, Vol. 63 (1956), 294–307.

    Google Scholar 

  166. Maddux,R.D., Topics in relation algebras, Ph.D Thesis, University of California, Berkeley (1978).

    Google Scholar 

  167. Maddux,R.D., Sufficient conditions for representability of relation algebras, Algebra Universalis Vol 8 (1978), 162–172.

    Google Scholar 

  168. Maddux,R.D., Some varieties containing relation algebras, Trans. Amer. Math. Soc. Vol 272 (1982), 501–526.

    Google Scholar 

  169. Maddux,R.D., A sequent calculus for relation algebras, Ann. Pure Appl. Logic Vol 25 (1983), 73–101.

    Google Scholar 

  170. Maddux,R.D., Pair-dense relation algebras, Trans. Amer. Math. Soc. (to appear).

  171. Maddux,R.D., Review of Henkin-Monk-Tarski: Cylindric Algebras Part II, J. Symbolic Logic (1988), 239–241.

  172. Maddux,R.D., Nonfinite axiomatizability results for cylindric and relation algebras, J. Symbolic Logic Vol 54, No 3 (Sept. 1989), 951–974.

    Google Scholar 

  173. Maddux,R.D., The neat embedding problem and the number of variables required in proofs, Proc. Amer. Math. Soc. (To appear).

  174. Maddux,R.D., Finitary algebraic logic, Z. Math. Logic Grundl. Math. Bd 35 (1989), 321–332.

    Google Scholar 

  175. Maddux,R.D., A collection of research problems on relation algebras, Manuscript, Dept. Math. Iowa State University, Ames, Iowa (August 14, 1989).

    Google Scholar 

  176. Maddux,R.D., Canonical relativized cylindric set algebras, Proc. Amer. Math. Soc. Vol 107, No 2 (October 1989), 465–478.

    Google Scholar 

  177. Mafcir,E.S. and Plotkin,B.I, The automorphism group of a database (in Russian), Ukrainskii Math. J. Vol 40 (1988), 335–345.

    Google Scholar 

  178. Makkai,M., Stone duality for first order logic, Advances in Mathematics (Academic Press, New York and London) Vol 65, No 2 (August 1987).

    Google Scholar 

  179. Makkai,M. and Reyes,G.E., First Order Categorical Logic, Lecture Notes in Mathematics Vol 611, Springer-Verlag, Berlin (1977).

    Google Scholar 

  180. Maksimova,L.L., Craig's interpolation theorem and amalgamable varieties, Soviet Math. Dokl., American Mathematical Society 1978 Vol 18, No 6 (1977).

  181. Maksimova,L.L., Interpolation Properties of Superintuitionistic Logics, Studia Logica Vol XXXVIII, No 4 (1979), 419–428.

    Google Scholar 

  182. Maksimova,L.L., Teoremi ob opredelimosti v norrnalnih rasshirenijah logiki dokazujemocti (Theorems for determination of normal extensions of propositional logics) (in Russian), Preprint No 9, Institut of Mathematics, Siberian Branch Academy of Sciences of the USSR, Novosibirsk, 1988.

    Google Scholar 

  183. Maksimova,L.L. and Rybakov,V., On the lattice of normal modal logics (in Russian), Algebra i Logika Vol 13, No 2 (1974 pages 188–216).

    Google Scholar 

  184. Malinowski,J., On the number of quasi-modal algebras, Bull. Section of Logic Vol 14,3 (1985), 99–102.

    Google Scholar 

  185. McKenzie,R.N. McNulty,G.F. and Taylor,W.F., Algebras, Lattices, Varieties, The Wadsworth and Brooks/Cole Mathematics Series, Monterey, California (1987 (Vol I), 1990 (Vol 2)).

  186. Mikulás,S. Sain,I. and Simon,A., On the complexity of the equational theory of relation algebras with standard projection elements, Preprint, Math. Inst. Hungar. Acad. Sci., Budapest, 1990, submitted.

    Google Scholar 

  187. Monk,J.D., Polyadic Heyting algebras, Notices Amer. Math. Soc. Vol 7 (1960), p. 735.

    Google Scholar 

  188. Monk,J.D., On representable relation algebras, Michigan Math. J. Vol 11 (1964), 207–210.

    Google Scholar 

  189. Monk,J.D., Nonfinitizability of classes of representable cylindric algebras, J. Symbolic Logic Vol 34 (1969), 331–343.

    Google Scholar 

  190. Monk,J.D., On an algebra of sets of finite sequences, J. Symbolic Logic Vol 35 (1970), 19–28.

    Google Scholar 

  191. Monk,J.D., Provability with finitely many variables, Proc. Amer. Math. Soc. Vol 27 (1971), 353–358.

    Google Scholar 

  192. Monk,J.D., Some problems in algebraic logic, Colloq. Inter. de Logic, CNRS Vol 249 (1977), 83–88.

    Google Scholar 

  193. Monk,J.D., Review on the book: First order categorical logic, by M. Makkai and G. Reyes, Bulletin Amer. Math. Soc. Vol 84,6 (Nov. 1978), 1378–1380.

    Google Scholar 

  194. Monk,J.D., Structure problems for cylindric algebras, In [AMN]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), 413–429.

    Google Scholar 

  195. Monk,J.D., Lectures on cylindric set dgebras, Preprint, Boulder, 1991. Proceedings of the 1991 Fall Banach Semester, Banach Center for Mathematics, Warsaw.

    Google Scholar 

  196. Naturman,C. and Rose,H., Interior algebras: Some universal algebraic aspects, Research Reports No 074, The university of Cape Town (1989), 39pp.

  197. Németi,I., Connections between cylindric algebras and initial algebra semantics of CF languages, Mathematical Logic in Computer Science (Proc. Conf. Salgótarján Hungary 1978) (Ed.s: Dömölki,B. and Gergely,T.) Colloq. Math. Soc. J. Bolyai Vol 26, North-Holland, Amsterdam (1981), 561–605.

    Google Scholar 

  198. Németi,I., Some constructions of cylindric algebra theory applied to dynamic algebras of programs, Comp. Linguist. Comp. Lang. Vol 14 (1980), 43–65.

    Google Scholar 

  199. Németi,I., Dynamic dgebras of programs, Fundamentals of Computation Theory'81 (Proc. Conf. Szeged 1981), Lecture Notes in Computer Science Vol 117, Springer-Verlag, Berlin (1981), 281–290.

    Google Scholar 

  200. Németi,I., Decidable varieties of cylindric algebras, Preprint, Math. Inst. Hungar. Acad. Sci., Budapest, 1985 (submitted).

    Google Scholar 

  201. Németi,I., Logic with three variables has Gödel's incompleteness property — thus free cylindric alebras are not atomic, Preprint No 49/85, Math. Inst. Hungar. Acad. Sci., Budapest, July 1985.

    Google Scholar 

  202. Németi,I., Free dgebras and decidability in algebraic logic. (In Hungarian), Dissertation for D.Sc. with Hung. Academy of Sciences, Budapest (1986), xviii+169 pp.

    Google Scholar 

  203. Németi,I., On varieties of cylindric dgebras with applications to logic, Annals of Pure and Applied Logic Vol 36 (1987), 235–277.

    Google Scholar 

  204. Németi,I., Decidability of relation dgebras with weakened associativity, Proc. Amer. Math. Soc. Vol 100,2 (1987), 340–344.

    Google Scholar 

  205. Németi,I., On cylindric dgebraic model theory, in [BMP], 37–76 (1990).

  206. Ng,K.C., Relation algebras with transitive closure, Dissertation, University of California, Berkeley (1984), iv+157pp.

    Google Scholar 

  207. Nguyen,T.T., A relational model of Demonic Nondeterministic programs, Research Report RR. 90-15, INFO, Universitè Catholique de Louvain (Unite d'Informatique), Belgium (1990), International J. of Foundations of Computer Science, to appear.

    Google Scholar 

  208. Olivier,J.-P. and Serrato,D., Catégories de Dedekind. Morphisms dans les catégories de Schröder, C.R. Acad. Sci. Paris Vol 290 (1980), 939–941.

    Google Scholar 

  209. Ouellet,R., A categorial approach to polyadic algebras, Studia Logica Vol 41 (1982), 317–327.

    Google Scholar 

  210. Ono,H., Interpolation and the Robinson property for logics not closed under the Boolean operations, Algebra Universalis Vol 23 (1986), 111–122.

    Google Scholar 

  211. Orlowska,E., Relational interpretation of modal logics, In [AMN]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), 443–471.

    Google Scholar 

  212. Orlowska,E., Dynamic logic with program specifications and its relational proof system, Preprint, Polish Academy of Sciences, P.O. Box 22, PKiN, 00-901 Warsaw, Poland, 1989.

    Google Scholar 

  213. Pigozzi,D., Fregean Algebraic Logic, In [AMN]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), 473–502.

    Google Scholar 

  214. Pinter,C., A simple algebra of first order logic, Notre Dame J. Formal Logic Vol 1 (1973), 361–366.

    Google Scholar 

  215. Pinter,C., Cylindric algebras and algebras of substitutions, Trans. Amer. Math. Soc. Vol 175 (1973), 167–179.

    Google Scholar 

  216. Pinter,C., A simpler set of axioms for polyadic algebras, Fund. Math. Vol 79 (1973), 223–232.

    Google Scholar 

  217. Pinter,C., Algebraic logic with generalized quantifiers, Notre Dame J. Formal Logic Vol 16 (1975), 511–516.

    Google Scholar 

  218. Pinter,C., Cylindric algebras with a property of Rasiowa and Sikorski, Bull. Section of Logic Vol 7,2 (1978), 95.

    Google Scholar 

  219. Plotkin,B.I, Galois theory of Databases, Algebra — Some current trends. (Proc. Conf. Varna 1986) (ed. Avramov,L.L. et al.) Lecture Notes in Mathematics Vol 1352, Springer-Verlag, Berlin (1988), 147–161.

    Google Scholar 

  220. Plotkin,B.I., Halmos (polyadic) algebras in the database theory, In [AMN]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), 503–518.

    Google Scholar 

  221. Pratt,W., Dynamic algebras as a well behaved fragment of relation algebras, in [BMP] (1990), 77–110.

  222. Preller,A., On the relationship between the classical and the categorical direct products of algebras, Nederl. Akad. Wetensch. Proc. Ser. A, Indag. Math. Vol.30 Vol 71 (1968), 512–516.

    Google Scholar 

  223. Preller,A., Logíque algébrique infinitaire, These Doct. Sci. Math. Lyon (1968), 218pp.

  224. Preller, A., Logique algebrique infinitaire. Complétude des calculs L αβ, C.R. Acad. Sci. Paris Vol 268 (1969), 1509–1511, 1589–1592.

    Google Scholar 

  225. Preller,A., On the weak representability of σ-complete dimension complemented cylindric algebras, Algebra i Logica Sem. Vol 8 (1969), 695–711.

    Google Scholar 

  226. Preller,A., Substitution algebras in their relation to cylindric algebras, Arch. Math. Logik Grundl. Vol 30 (1970), 91–96.

    Google Scholar 

  227. Quine,W.V., Toward a calculus of concepts, J. Symbolic Logic Vol 1 (1936), 2–25.

    Google Scholar 

  228. Quine,W.V., Algebraic Logic and Predicate Functors, Bobbs-Merrill Publ. Co. (1971), 25pp.

  229. Quine,W.V., Predicate functors revisited, Journal of Symbolic Logic Vol 46 (1981), 649–652.

    Google Scholar 

  230. Rasiowa,H., Algebraic treatment of the functional calculi of Heyting and Lewis, Fund. Math. 38 (1951), 99–126.

    Google Scholar 

  231. Rasiowa,H., Post algebras as a semantic foundation of m-valued logics, In: Studies in Algebraic Logic (ed.: A. Daigneault), MAA Studies in Mathematics 9 (1974), 92–143.

  232. Rasiowa,H., An Algebraic Approach to Non-Classical Logics, Studies in Logic and the Foundations of Mathematics, North-Holland Vol 78 (1974).

  233. Rasiowa,H., Topological representations of Post algebras of order ω + and open theories based on ω +-valued Post logic, Studia Logica Vol XLIV/4 (1985), 353–368.

    Google Scholar 

  234. Rasiowa,H. and Sikorski,R., The Mathematics of Metamathematics, Panstwowe Wydawnictwo Naukowe, Warsawa (1963), 519pp.

    Google Scholar 

  235. Rautenberg,W., Klassische und nichtklassische Aussagenlogik, Logik und Grundlagen der Mathematik Vol 22 (1979), xi+361pp.

    Google Scholar 

  236. Rautenberg,W., Axiomatizing logics closely related to varieties, Studia Logica (this issue).

  237. Resek,D. and Thompson,R.J., An equational characterization of relativized cylindric algebras, In [AMN]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), 519–538.

    Google Scholar 

  238. Reyes,G.E., Local definability theory, Annals of Mathematical Logic Vol 1, no 1 (1970), 95–137.

    Google Scholar 

  239. de Roever,W.P., Jr., A formalization of various parameter mechanisms as products of relations within a calculus of recursive program schemes, Théorie des Algorithmes, des Languages et de la Programmation, Séminaires IRIA (1972), 55–88.

  240. Rosenberg,S.M., On varieties of Halmos polyadic algebras (in Russian), Latv. Mat. Ezhegodnik Vol 32 (1988), 85–89.

    Google Scholar 

  241. Sain,I., Strong amalgamation and epimorphisms of cylindric algebras and Boolean algebras with operators, Studia Logica (to appear).

  242. Sain,I., Positive results related to the Jónsson, Tarski-Givant representation problem, Expanded version of Preprint Math. Inst. Hungar. Acad. Sci., Oct. 1987.

  243. Sain,I., Searching for a finitizable algebraization of first order logic, Annals of Pure and Applied Logic (submitted), Also: Preprint Math. Inst. Hungar. Acad. Sci. No 53/1987, 78pp.

  244. Sain,I., Total correctness in nonstandard logics of programs, Theoretical Computer Science Vol 50 (1987), 285–321.

    Google Scholar 

  245. Sain,I., Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic, in [BMP] 209–226 (1990).

  246. Sain,I., and Thompson,R.J., Strictly finite schema axiomatization of quasipolyadic algebras, In [AMN]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), 539–571.

    Google Scholar 

  247. Salibra,A., A general theory of algebras with quantifiers, In [AMN]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), 573–620.

    Google Scholar 

  248. Sanders,J.G., A Relational Theory of Computing, Lecture Notes in Computer Science Vol 82, Springer-Verlag, Berlin (1980), ix+146pp.

    Google Scholar 

  249. Schein,B.M., Relation algebras and function semigroups, Semigroup Forum Vol 1 (1970), 1–62.

    Google Scholar 

  250. Schein,B.M., Representation of reducts of Tarski relation algebras, In [AMN]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), 621–635.

    Google Scholar 

  251. Schmidt,G. and Ströhlein,T., Relationen und Graphen, Series Mathematik für Informatiker, Springer-Verlag (1989).

  252. Schönfeld,W., Applications of relation algebras in computer science, Notices Amer. Math. Soc. (A-254) Vol 24 (1977).

  253. Schwartz,D., Koherante Systeme von Booleschen Algebren, Math. Nachr. Vol 91 (1979), 253–262.

    Google Scholar 

  254. Schwartz,D., Polyadic MV-algebras, Z. Math. Logik Grundl. Math. Vol 26 (1980), 561–564.

    Google Scholar 

  255. Schwartz,D., Cylindric algebras with filter quantifiers, Z. Math. Logik Grundl. Math. Vol 26 (1980), 251–254.

    Google Scholar 

  256. Serény,G., Compact cylindric set algebras, Bull. Section of Logic (Warsaw-Łodz, June 1985), 57–64.

  257. Serény,G., Compact cylindric set algebras, Dissertation with Eötvös Loránd Univ., Budapest (1986), 65pp.

    Google Scholar 

  258. Shafaat,A., Homomorphisms, homomorphic relations and power algebras, Periodica Mathematica Hungarica Vol 11 (1980), 89–94.

    Google Scholar 

  259. Shelah,S., On a problem in cylindric algebra, In [AMN]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), 645–664.

    Google Scholar 

  260. Simon,A., A complete axiomatization of equations valid in representable cylindric algebras and typeless logic, in [AMN]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), 665–670.

    Google Scholar 

  261. Skornyakov,L.A., Matrix relation algebras (in Russian), Mat. Zametki Vol 41 (1987), 129–137. English translation: QA1.M424E. See Current Math. Publ., v.19, #12.

    Google Scholar 

  262. Smorynski,C., Fixed point algebras, Bull. Amer. Math. Soc. Vol 6 (1982), 317–356. (Errata: (1984), 407).

    Google Scholar 

  263. Smorynski,C., Self Reference and Modal Logic, Springer-Verlag, Berlin (1985).

    Google Scholar 

  264. Solovay,R.M., Provability interpretations of modal logic, Israel J. of Mathematics Vol 25 (1976), 287–304.

    Google Scholar 

  265. Tarski,A. and Givant,S., A formalization of set theory without variables, AMS Colloquium Publications, Providence, Rhode Island Vol 41 (1987).

  266. Tembrowski,B., Q-ultrafilters and normal ultrafilters in B-algebras, Studia Logica Vol XLV, 2 (1986).

  267. Thompson,R.J., Transformational structure of algebraic logics, Ph. D. Dissertation, University of California, Berkeley (1981).

    Google Scholar 

  268. Thompson,R.J., Semigroups of finite transformations and cylindric algebras, Semigroup Forum (to appear). Also: Preprint Math. Inst. Hungar. Acad. Sci. No 45/1987.

  269. Thompson,R.J., Noncommutative cylindric algebras and relativizations of cylindric algebras, in [BMP] 273–278 (1990).

  270. Topencharov,V., Elements de la theorie des categories polyadiques, C.R. Acad. Bulgare Sci. Vol 27 (1974), 743–746.

    Google Scholar 

  271. Trnková,V. and Reiterman,J., Dynamic algebras with test, J. Computer System Sciences Vol 35,2 (1987), 229–242.

    Google Scholar 

  272. Urquhart,A., Free Heyting algebras, Algebra Universalis Vol 3 (1973), 94–97.

    Google Scholar 

  273. Vardanyan,V.A., Arithmetic complexity of predicate logics of provability and their fragments, Soviet Mathematics Doklady Vol 33,3 (1986), 569–572.

    Google Scholar 

  274. Venema,Y., Cylindric modal logic, Preprint, University of Amsterdam, ITLI publication series ML-91-01 (1991), 32pp.

  275. Venema,Y., Many-dimensional modal logic, Doctoral Dissertation, University of Amsterdam (1991), vii+178pp.

  276. Venne,M., Languages, theories et algebres polyadiques d'ordres superieurs, Doctoral dissertation, Université de Montréal, Montreal (1965), viii+110pp.

    Google Scholar 

  277. Venne,M., Algebres polyadiques d'ordres supérieurs, C.R. Acad. Sci. Paris Sér. A-B Vol ser. A, 262 (1966), 1236–1238, 1293–1294.

    Google Scholar 

  278. Verdú,V., Modal Heyting algebras with comodal operators, Commentarii Mathematici Universitatis Sancti Pauli Vol 35 (1986), 59–64.

    Google Scholar 

  279. Volger,H., Completeness Theorem for Logical Categories, Lecture Notes in Mathematics Vol 445, SpringerVerlag, Berlin (1975), 51–86.

    Google Scholar 

  280. Volkov,N.D., Halmos algebras and relation algebras (in Russian), Latv. Mat. Ezhegodnik Vol 30 (1986), 110–123.

    Google Scholar 

  281. Volkov,N.D., The transition from a relation algebra to a Halmos algebra, In: Algebra and Discrete Mathematics: Theoretical Foundations of Software, (in Russian), Latv. Gos. Univ., Riga (1986). See Current Math. PubL, v.19, #17.

    Google Scholar 

  282. Volkov,N.D., Opertions of Halmos polyadic algebras in relational algebras (in Russian), Latv. Mat. Ezhegodnik Vol 31 (1988), 103–114.

    Google Scholar 

  283. Volkov,N.D., Filters in relational algebras and in Halmos polyadic algebras (in Russian), Latv. Mat. Ezhegodnik Vol 32 (1988), 60–6T.

    Google Scholar 

  284. Werner,H., Discriminator Algebras, Akademie Verlag, Berlin (1978).

    Google Scholar 

  285. Wronski,A., On a Form of Equational Interpolation Property, Foundations in Logic and Linguistics, Problems and Solutions, Selected contributions to the 7th International Congress, Plenum Press, London (1984).

    Google Scholar 

  286. Wadge,W.W., A complete natural deduction system for the relation calculus, University of Warwick, Theory of Computation Report No 5 (1988).

  287. Zierer,H., Relationale Semantik, Diplomarbeit, Institut für Informatik, Technische Universität, München (1983).

    Google Scholar 

  288. Zlatoš, P., Two notes on locally finite cylindric algebras, Comment. Math. Univ. Carol. Vol 25,1 (1984), 181–199.

    Google Scholar 

  289. Zlatoš,P., On conceptual completeness of syntactic-semantical systems, Periodica Math. Hungar. Vol 16,3 (1985), 145–174.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute Of the Hungarian Academy of Sciences, PF.127 H-1364, Budapest, Hungary

    István Németi

Authors
  1. István Németi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by Hungarian National Foundation for Scientific Research grant No. 1810.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Németi, I. Algebraization of quantifier logics, an introductory overview. Stud Logica 50, 485–569 (1991). https://doi.org/10.1007/BF00370684

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation