Solving equation systems in ω-categorical algebras

DOI10.1142/S0219061321500203MaRDI QIDQ5163170

Manuel Bodirsky, Thomas Quinn-Gregson

Publication date: 3 November 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

constraint satisfaction problemcomplexity dichotomyomega-categoricalminor-preserving mapmodel complete corepseudo-Siggerssolving equational systems

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Dichotomies in the complexity of solving systems of equations over finite semigroups
• Maximal infinite-valued constraint languages
• Disjunctions, independence, refinements
• The wonderland of reflections
• Upper bounds for growth in the Ryll-Nardzewski function of an \(\omega{}\)- categorical, \(\omega{}\)-stable theory
• QE nil-2 groups of exponent 4
• The complexity of solving equations over finite groups
• On homogeneous semilattices and their automorphism groups
• Minimal functions on the random graph
• \(\aleph_0\)-categoricity of groups
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
• Reducts of Ramsey structures
• Model Companions for ℵ 0 -Categorical Theories
• Component Subsets of the Free Lattice on n Generators
• Constraint Satisfaction with Countable Homogeneous Templates
• Fast Decision Procedures Based on Congruence Closure
• A Group Theoretic Presentation of the Alternating Group on Five Symbols, A₅
• On the Structure of Polynomial Time Reducibility
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• The bi-embeddability relation for countable abelian groups
• Tractable Set Constraints
• Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
• Constraint Satisfaction Problems over Numeric Domains
• Temporal Constraint Satisfaction Problems in Fixed-Point Logic
• Cores of Countably Categorical Structures
• Classifying the Complexity of Constraints Using Finite Algebras
• A Simple Algorithm for Mal'tsev Constraints
• Topological Birkhoff
• Infinitary properties of abelian torsion groups
• Partially Ordered Sets

This page was built for publication: Solving equation systems in ω-categorical algebras