Complexity of equations valid in algebras of relations part I: Strong non-finitizability

Annals of Pure and Applied Logic 89 (2):149-209 (1997)
  Copy   BIBTEX

Abstract

We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 < n < ω. Completely analogous statement holds for the case n ω. This improves Monk's famous non-finitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCAn + k. We prove that the complementation-free subreducts of RCAn do not form a variety. We also investigate the reason for the above “non-finite axiomatizability” behaviour of RCAn. We look at all the possible reducts of RCAn and investigate which are finitely axiomatizable. We obtain several positive results in this direction. Finally, we summarize the results and remaining questions in a figure. We carry through the same programme for RPEAn and for RRA. By looking into the reducts we also investigate what other kinds of natural algebras of relations are possible with more positive behaviour than that of the well known ones. Our investigations have direct consequences for the logical properties of the n-variable fragment Ln of first order logic. The reason for this is that RCAn and RPEAn are the natural algebraic counterparts of Ln while the varieties SNrnCAn + k are in connection with the proof theory of Ln. This paper appears in two parts. The first part contains the non-finite axiomatizability results. The present second part contains finite axiomatizations of some fragments together with a figure summarizing the finite and non-finite axiomatizability results in this area and the problems left open

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Free set algebras satisfying systems of equations.G. Aldo Antonelli - 1999 - Journal of Symbolic Logic 64 (4):1656-1674.
Groups and algebras of binary relations.Steven Givant & Hajnal Andréka - 2002 - Bulletin of Symbolic Logic 8 (1):38-64.
Expressibility of properties of relations.Hajnal Andréka, Ivo Düntsch & István Németi - 1995 - Journal of Symbolic Logic 60 (3):970-991.
B-varieties with normal free algebras.Bronis?aw Tembrowski - 1989 - Studia Logica 48 (4):555 - 564.
An algebraic study of well-foundedness.Robert Goldblatt - 1985 - Studia Logica 44 (4):423 - 437.
A note on the logic of signed equations.Stephen L. Bloom - 1982 - Studia Logica 41 (1):75 - 81.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.

Analytics

Added to PP
2013-10-30

Downloads
24 (#639,942)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Algebraizable Logics.W. J. Blok & Don Pigozzi - 2022 - Advanced Reasoning Forum.
Vorlesungen über die algebra der logik.Ernst Schröder, Jakob Lüroth & Karl Eugen Müller - 1890 - Leipzig: B. G. Teubner. Edited by Jakob Lüroth & Karl Eugen Müller.
Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
Cylindric algebras.Leon Henkin - 1971 - Amsterdam,: North-Holland Pub. Co.. Edited by J. Donald Monk & Alfred Tarski.

View all 38 references / Add more references