FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH
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 struct...
Saved in:
Main Author: | Egrot R.O.B. |
---|---|
Other Authors: | Mahidol University |
Format: | Article |
Published: |
2023
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/83429 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Recursive Axiomatisations from Separation Properties
by: Rob Egrot
Published: (2022) -
Meet-completions and ordered domain algebras
by: R. Egrot, et al.
Published: (2018) -
Representable posets
by: Rob Egrot
Published: (2018) -
Recursive axiomatizations for representable posets
by: Rob Egrot
Published: (2020) -
DECIDABILITY OF FIRST ORDER LOGIC OF BOOLEAN ALGEBRAS
by: LIM JIN XING
Published: (2021)