Undecidable relativizations of algebras of relations
-
Published:1999-06
Issue:2
Volume:64
Page:747-760
-
ISSN:0022-4812
-
Container-title:Journal of Symbolic Logic
-
language:en
-
Short-container-title:J. symb. log.
Author:
Mikulás Szabolcs,Marx Maarten
Abstract
AbstractIn 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.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. Németi I. , Free Algebras and Decidability in Algebraic Logic, Dissertation with the Hungarian Academy of Sciences, 1986.
2. Taming first-order logic
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Relation Algebras by Games;2002