Undecidable Relativizations of Algebras of Relations

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

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2017-02-21

Downloads
8 (#1,345,183)

6 months
1 (#1,516,603)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tolerance logic.Maarten Marx - 2001 - Journal of Logic, Language and Information 10 (3):353-374.
Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.

Add more citations

References found in this work

No references found.

Add more references