The reducts of equality up to primitive positive interdefinability
From MaRDI portal
Publication:3066793
DOI10.2178/jsl/1286198146zbMath1408.03021arXiv0810.2270MaRDI 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
lattice; permutations; Galois connection; relational structure; invariant relation; reduct; local clone; primitive positive definition
08A70: Applications of universal algebra in computer science
03D15: Complexity of computation (including implicit computational complexity)
08A40: Operations and polynomials in algebraic structures, primal algebras
03C40: Interpolation, preservation, definability
Related Items
Unnamed Item, Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field, Decomposing Quantified Conjunctive (or Disjunctive) Formulas, Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones, Distance constraint satisfaction problems, Reducts of the random partial order, The complexity of counting quantifiers on equality languages, More sublattices of the lattice of local clones, Reducts of the random bipartite graph, Minimal functions on the random graph, Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting), A survey of homogeneous structures, Schaefer's Theorem for Graphs, A CLOSED ALGEBRA WITH A NON-BOREL CLONE AND AN IDEAL WITH A BOREL CLONE, Reconstructing the topology of clones, The Complexity of Counting Quantifiers on Equality Languages
