Bare canonicity of representable cylindric and polyadic algebras
Logic
2013-05-22 v1 Logic in Computer Science
Abstract
We show that for finite n at least 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived from random graphs.
Keywords
Cite
@article{arxiv.1202.5961,
title = {Bare canonicity of representable cylindric and polyadic algebras},
author = {Jannis Bulian and Ian Hodkinson},
journal= {arXiv preprint arXiv:1202.5961},
year = {2013}
}