Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T12:33:32.860Z Has data issue: false hasContentIssue false

FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH

Published online by Cambridge University Press:  29 October 2021

ROB EGROT
Affiliation:
FACULTY OF INFORMATION AND COMMUNICATION TECHNOLOGY MAHIDOL UNIVERSITY, SALAYA 73170, THAILAND E-mail: robert.egr@mahidol.ac.th
ROBIN HIRSCH
Affiliation:
DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY COLLEGE LONDON LONDON WC1E 6BT, UK E-mail: r.hirsch@ucl.ac.uk
Rights & Permissions [Opens in a new window]

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.

Information

Type
Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
Figure 0

Figure 1Defining an injection from a representation.

Figure 1

Figure 2For each $w\in N\setminus \{x,y\}$, $\exists $ must assign the label $c_w=N'(w,z)$.

Figure 2

Figure 3Creating a red clique of size 2.

Figure 3

Figure 4The label $N'(w,z)$ in case (c).

Figure 4

Figure 5The red triangle involving $w,w^*$ and z.