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

DOI10.1017/jsl.2021.88OpenAlexW3209540238WikidataQ113858282 ScholiaQ113858282MaRDI QIDQ5100063

Robin Hirschl, Robert Egrot

Publication date: 29 August 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01329

zbMATH Keywords

representable relation algebrasbounded quantifier depth axiomatisationfinite variable axiomatisationRRA

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (1)

Seurat games on Stockmeyer graphs

Uses Software

• RelView
• Stone Algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
• Relation algebras by games
• The calculus of relations as a foundation for mathematics
• Structural characterizations of the navigational expressiveness of relation algebras on a tree
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• Verifying minimum spanning tree algorithms with Stone relation algebras
• On representable relation algebras
• The representation of relational algebras
• Nonfinite axiomatizability results for cylindric and relation algebras
• Complete representations in algebraic logic
• Relation algebra reducts of cylindric algebras and an application to proof theory
• Completely Representable Relation Algebras
• Canonical varieties with no canonical axiomatisation
• Relation algebras from cylindric algebras. II
• Seurat games on Stockmeyer graphs

This page was built for publication: FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH