Undecidable relativizations of algebras of relations

Journal of Symbolic Logic 64 (2):747-760 (1999)
  Copy   BIBTEX


In this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic



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

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

Undecidable theories of Lyndon algebras.Vera Stebletsova & Yde Venema - 2001 - Journal of Symbolic Logic 66 (1):207-224.
The logic of Peirce algebras.Maarten De Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
Cylindric algebras.Leon Henkin - 1971 - Amsterdam,: North-Holland Pub. Co.. Edited by J. Donald Monk & Alfred Tarski.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.


Added to PP

44 (#348,184)

6 months
3 (#961,598)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.

Add more citations

References found in this work

Taming first-order logic.Szabolcs Mikulás - 1998 - Logic Journal of the IGPL 6 (2):305-316.
Taming logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.

Add more references