scientific article; zbMATH DE number 6930501

zbMATH Open1394.08009arXiv1210.3344MaRDI QIDQ4583809FDOQ4583809

Authors: Andrei A. Bulatov, Amir Hedayaty 

Publication date: 3 September 2018

Full work available at URL: https://arxiv.org/abs/1210.3344

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

approximationGalois correspondenceco-clonescounting constraint satisfaction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Cited In (4)

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

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)