Constraint satisfaction, irredundant axiomatisability and continuous colouring
type: Item
instance of: scholarly article
title: Constraint satisfaction, irredundant axiomatisability and continuous colouring
zbMATH Open document ID: 1294.03021
author: Marcel Jackson
author: Belinda Trotta
published in: Studia Logica
publication date: 2013-08-19T00:00:00Z
Mathematics Subject Classification ID: 03C07
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 03C98
Mathematics Subject Classification ID: 08C15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6199438
zbMATH Keywords: quasivariety
zbMATH Keywords: antivariety
zbMATH Keywords: irredundant axiomatisability
zbMATH Keywords: standard topological quasivarieties
zbMATH Keywords: graph dualities
zbMATH Keywords: constraint satisfaction problems
MaRDI profile type: Publication
full work available at URL: s11225-012-9372-4
OpenAlex ID: W2026679370
cites work: Open questions related to the problem of Birkhoff and Maltsev
cites work: On digraph coloring problems and treewidth duality
cites work: Q3934450
cites work: Q4220406
cites work: Q4679049
cites work: Standard topological algebras: syntactic and principal congruences and profiniteness
cites work: The axiomatizability of topological prevarieties
cites work: Simple compact topological lattices
cites work: Q4530231
cites work: On pseudovarieties
cites work: Antivarieties and colour-families of graphs.
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Finiteness properties of varieties and the restriction to finite algebras.
cites work: FINITE SEMIGROUPS WITH INFINITE IRREDUNDANT IDENTITY BASES
cites work: Flat algebras and the translation of universal Horn logic to equational logic
cites work: Q3514350
cites work: Q3965241
cites work: A Characterisation of First-Order Constraint Satisfaction Problems
cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
cites work: EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
cites work: On classes of relations and graphs determined by subobjects and factorobjects
cites work: Duality theorems for finite structures (characterising gaps and good characterisations)
cites work: Theorems on Compact Totally Disconnected Semigroups and Lattices
cites work: Homomorphism preservation theorems
cites work: On the quasivarieties generated by finite semigroups
cites work: Quasi-equational bases for graphs of semigroups, monoids and groups.
cites work: Q5392460
cites work: RESIDUAL PROPERTIES OF SIMPLE GRAPHS
cites work: Residual properties of pre-bipartite digraphs
DOI: 10.1007/S11225-012-9372-4
description: scientific article; zbMATH DE number 6199438