On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
From MaRDI portal
Publication:3170559
DOI10.1002/MALQ.201010015zbMATH Open1245.03106OpenAlexW2018384874MaRDI QIDQ3170559FDOQ3170559
Publication date: 27 September 2011
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201010015
Recommendations
- On the definition and the representability of quasi-polyadic equality algebras
- On the equational theory of representable polyadic equality algebras
- scientific article
- On the equational theory of representable polyadic equality algebras (extended abstract)
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
Cites Work
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Finitary polyadic algebras from cylindric algebras
- On Cylindric Algebras Satisfying Merry-go-round Properties
- Cylindric modal logic
- The representation of relation algebras. II
- Provability with Finitely Many Variables
- Title not available (Why is that?)
- A Modal Logic for Quantification and Substitution
Cited In (5)
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)