Boolean topological graphs of semigroups: the lack of first-order axiomatization
From MaRDI portal
Publication:485412
DOI10.1007/s00233-014-9582-3zbMath1348.08001OpenAlexW2053962357WikidataQ59399061 ScholiaQ59399061MaRDI QIDQ485412
Belinda Trotta, Michał M. Stronkowski
Publication date: 9 January 2015
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-014-9582-3
relational structuresfirst-order axiomatizationBoolean coresprofinite structurestopological prevarieties
Quasivarieties (08C15) Relational systems, laws of composition (08A02) Basic properties of first-order languages and structures (03C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- Quasi-equational bases for graphs of semigroups, monoids and groups.
- Residual properties of pre-bipartite digraphs
- The axiomatizability of topological prevarieties
- A partially ordered space which is not a Priestley space
- On classes of relations and graphs determined by subobjects and factorobjects
- Standard topological algebras: syntactic and principal congruences and profiniteness
- RESIDUAL PROPERTIES OF SIMPLE GRAPHS
- Theorems on Compact Totally Disconnected Semigroups and Lattices
- Dualities for Constraint Satisfaction Problems
This page was built for publication: Boolean topological graphs of semigroups: the lack of first-order axiomatization