Bare canonicity of representable cylindric and polyadic algebras
From MaRDI portal
Publication:387126
DOI10.1016/j.apal.2013.04.002zbMath1321.03077arXiv1202.5961OpenAlexW2022150940MaRDI QIDQ387126
Jannis Bulian, I. M. Hodkinson
Publication date: 11 December 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.5961
random graphsBoolean algebras with operatorscylindric algebrascanonical classcanonical extensionspolyadic algebras
Applications of graph theory (05C90) Equational classes, universal algebra in model theory (03C05) Cylindric and polyadic algebras; relation algebras (03G15) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Abstract algebraic logic (03G27)
Related Items
Omitting Types in Fragments and Extensions of First Order Logic ⋮ A brief history of Tarskian algebraic logic with new perspectives and innovations ⋮ A dichotomy for some elementarily generated modal logics ⋮ Canonical extensions and ultraproducts of polarities ⋮ Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations ⋮ Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic
Cites Work
- The core of a graph
- Cylindric algebras. Part II
- Model theory.
- Atom structures and Sahlqvist equations
- Tools and techniques in modal logic
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Elementary generation and canonicity for varieties of Boolean algebras with operators
- On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
- Graph Theory and Probability
- Strongly representable atom structures of cylindric algebras
- Canonical varieties with no canonical axiomatisation
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- Boolean Algebras with Operators. Part I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item