The reducts of equality up to primitive positive interdefinability

DOI10.2178/jsl/1286198146zbMath1408.03021arXiv0810.2270OpenAlexW2164778133MaRDI QIDQ3066793

Michael Pinsker, Hubie Chen, Manuel Bodirsky

Publication date: 12 January 2011

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

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

zbMATH Keywords

latticepermutationsGalois connectionrelational structureinvariant relationreductlocal cloneprimitive positive definition

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Complexity of computation (including implicit computational complexity) (03D15) Operations and polynomials in algebraic structures, primal algebras (08A40) Interpolation, preservation, definability (03C40)

Related Items (16)

Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ The Complexity of Counting Quantifiers on Equality Languages ⋮ More sublattices of the lattice of local clones ⋮ Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones ⋮ Reducts of the random bipartite graph ⋮ Reconstructing the topology of clones ⋮ Reducts of the random partial order ⋮ The complexity of counting quantifiers on equality languages ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ Minimal functions on the random graph ⋮ A survey of homogeneous structures ⋮ Unnamed Item ⋮ Schaefer's Theorem for Graphs ⋮ Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field ⋮ A CLOSED ALGEBRA WITH A NON-BOREL CLONE AND AN IDEAL WITH A BOREL CLONE ⋮ Distance constraint satisfaction problems

This page was built for publication: The reducts of equality up to primitive positive interdefinability