scientific article; zbMATH DE number 6930501

MaRDI QIDQ4583809zbMATH OpenFDO

Authors Andrei A. Bulatov, Amir Hedayaty

Publication date 3 September 2018

Full work available at URL https://arxiv.org/abs/1210.3344, http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-24-number-5-6-2015/mvlsc-24-5-6-p-405-424/

zbMATH Keywords

approximationco-clonescounting constraint satisfaction problemGalois correspondence

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Two types of Galois correspondences over quantaloid-typed sets
• scientific article; zbMATH DE number 663796
• The quantale of Galois connections
• Counting quasivarieties of equivalential algebras
• Counting modulo quantifiers on finite structures
• Counting nilpotent Galois extensions
• Toward quantization of Galois theory
• scientific article; zbMATH DE number 19609
• scientific article; zbMATH DE number 52738

Cited in

(4)

• Quantitative logic reasoning
• Quantified Constraints in Twenty Seventeen
• Consistency for counting quantifiers
• Constraint satisfaction with counting quantifiers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583809)