First-Order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier Depth

Journal of Symbolic Logic 87 (3):1283-1300 (2022)
  Copy   BIBTEX

Abstract

Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At(RRA) of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.

Links

PhilArchive



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

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

Non-representable relation algebras from vector spaces.Ian Hodkinson - 2020 - Australasian Journal of Logic 17 (2):82-109.
Atom structures of cylindric algebras and relation algebras.Ian Hodkinson - 1997 - Annals of Pure and Applied Logic 89 (2):117-148.

Analytics

Added to PP
2022-09-10

Downloads
21 (#762,792)

6 months
13 (#219,908)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Relation Algebras by Games.Robin Hirsch & Ian Hodkinson - 2003 - Bulletin of Symbolic Logic 9 (4):515-520.
Relation algebras from cylindric algebras, II.Robin Hirsch & Ian Hodkinson - 2001 - Annals of Pure and Applied Logic 112 (2-3):267-297.

Add more references