PROJECTIVE CLONE HOMOMORPHISMS

DOI10.1017/JSL.2019.23MaRDI QIDQ5000252zbMATH OpenOpenAlexFDO

Authors Manuel Bodirsky, Michael Pinsker, András Pongrácz

Publication date 12 July 2021

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.4601, http://real.mtak.hu/100544/1/MB_MP_AP_proj.pdf

zbMATH Keywords

constraint satisfaction problemautomatic continuityhomogeneous structureclonecanonical functionpolymorphism clonetrivial algebra

Mathematics Subject Classification ID

Automorphisms and endomorphisms of algebraic structures (08A35) Equational classes, universal algebra in model theory (03C05) Subalgebras, congruence relations (08A30) Interpolation, preservation, definability (03C40) Applications of universal algebra in computer science (08A70)

Recommendations

• Projective homogeneity
• scientific article; zbMATH DE number 4154512
• Projective and special homologies
• Homological projective duality
• scientific article; zbMATH DE number 3911284
• scientific article; zbMATH DE number 3872258
• scientific article; zbMATH DE number 459379
• Homomorphisms of projective remoteness planes
• scientific article; zbMATH DE number 1332345
• Projectivity of homogeneous left Lie loops

Cites work

• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• A dichotomy for first-order reducts of unary structures
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
• Autour De La Propriété Du Petit Indice
• Constraint satisfaction problems for reducts of homogeneous graphs
• Cores of Countably Categorical Structures
• Decidability of definability
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Minimal functions on the random graph
• On the scope of the universal-algebraic approach to constraint satisfaction
• Reconstructing the topology of clones
• Reducts of Ramsey structures
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
• The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
• The wonderland of reflections
• Topological Birkhoff
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
• Uniform Birkhoff

Cited in

(41)

• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
• The generic circular triangle-free graph
• 1-in-3 vs. not-all-equal: dichotomy of a broken promise
• The complexity of resilience problems via valued constraint satisfaction problems
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations
• 1-in-3 vs. not-all-equal: dichotomy of a broken promise
• CORES OVER RAMSEY STRUCTURES
• Uniform Birkhoff
• scientific article; zbMATH DE number 3911284 (Why is no real title available?)
• Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
• On a stronger reconstruction notion for monoids and clones
• Small clones and the projection property
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
• Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones
• A complexity dichotomy in spatial reasoning via Ramsey theory
• On guarded extensions of MMSNP
• Pseudo‐loop conditions
• Permutation groups with small orbit growth
• GMSNP and finite structures
• An order out of nowhere: a new algorithm for infinite-domain CSPs
• \( \omega \)-categorical structures avoiding height 1 identities
• Datalog-expressibility for monadic and guarded second-order logic
• Smooth approximations and relational width collapses
• An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
• Hrushovski's encoding and -categorical CSP monsters
• Complexity classification transfer for CSPs via algebraic products
• When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• An algebraic view on p-admissible concrete domains for lightweight description logics
• scientific article; zbMATH DE number 7406819 (Why is no real title available?)
• Smooth approximations and CSPs over finitely bounded homogeneous structures
• Homogeneity and homogenizability: hard problems for the logic SNP
• Polish topologies on endomorphism monoids of relational structures
• Projective clone homomorphisms
• The wonderland of reflections
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough
• Datalog-expressibility for monadic and guarded second-order logic
• Forbidden tournaments and the orientation completion problem
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
• Constraint satisfaction problems for reducts of homogeneous graphs
• ASNP: a tame fragment of existential second-order logic

This page was built for publication: PROJECTIVE CLONE HOMOMORPHISMS

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