On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
From MaRDI portal
Publication:3170559
Recommendations
- On the definition and the representability of quasi-polyadic equality algebras
- On the equational theory of representable polyadic equality algebras
- scientific article; zbMATH DE number 67043
- On the equational theory of representable polyadic equality algebras (extended abstract)
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
Cites work
- scientific article; zbMATH DE number 67043 (Why is no real title available?)
- A Modal Logic for Quantification and Substitution
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Cylindric modal logic
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Finitary polyadic algebras from cylindric algebras
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- On Cylindric Algebras Satisfying Merry-go-round Properties
- Provability with Finitely Many Variables
- The representation of relation algebras. II
Cited in
(6)- Axiomatizing complex algebras by games.
- Games in algebraic logic: axiomatisations and beyond
- New perspectives in algebraic logic, from neat embeddings to Erdős graphs
- Quasi-polyadic algebras and their dual position
- On the definition and the representability of quasi-polyadic equality algebras
- Bare canonicity of representable cylindric and polyadic algebras
This page was built for publication: On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170559)
