The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion
DOI10.1007/978-3-642-15025-8_20zbMath1287.08010arXiv0907.2634OpenAlexW3101220573MaRDI QIDQ3586013
Marcel Jackson, Mikhail V. Volkov
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2634
graphfinite basis problemRees matrix semigroupuniversal Horn classuniversal Horn sentenceunary semigroup identityunary semigroup varietyvariety membership problem
Lattices of varieties (08B15) Varieties and pseudovarieties of semigroups (20M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (19)
Cites Work
- The axiomatizability of topological prevarieties
- On classes of relations and graphs determined by subobjects and factorobjects
- Identities of a five-element \(0\)-simple semigroup
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Antivarieties and colour-families of graphs.
- Finitely axiomatizable quasivarieties of graphs
- On McKenzie's method
- Standard topological algebras: syntactic and principal congruences and profiniteness
- COMBINATORIAL REES–SUSHKEVICH VARIETIES ARE FINITELY BASED
- Flat algebras and the translation of universal Horn logic to equational logic
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion