On a stronger reconstruction notion for monoids and clones

DOI10.1515/forum-2020-0205OpenAlexW3204426018MaRDI QIDQ2121508

Publication date: 4 April 2022

Published in: Forum Mathematicum (Search for Journal in Brave)

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

zbMATH Keywords

clone reconstruction transformation monoid homogeneous structure topological monoid automatic homeomorphicity automatic action compatibility topological clone weak forall-exists-interpretation

Mathematics Subject Classification ID

Transformation groups and semigroups (topological aspects) (54H15) Operations and polynomials in algebraic structures, primal algebras (08A40) Relational systems, laws of composition (08A02) Automorphisms and endomorphisms of algebraic structures (08A35) Interpolation, preservation, definability (03C40) Model theory of denumerable and separable structures (03C15)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Polish groups and Baire category methods
Reconstructing the topology on monoids and polymorphism clones of the rationals
Semitransitive subsemigroups of the singular part of the finite symmetric inverse semigroup.
On automatic homeomorphicity for transformation monoids
Oligomorphic clones
Universal algebra and hardness results for constraint satisfaction problems
Semitransitive subsemigroups of the symmetric inverse semigroups.
Quasi finitely axiomatizable totally categorical theories
Transitivity of permutation groups on unordered sets
Polymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicity
Reconstructing the topology of the elementary self-embedding monoids of countable saturated structures
A uniform Birkhoff theorem
Datalog and constraint satisfaction with infinite templates
Lie algebras acting semitransitively
A survey of homogeneous structures
On semitransitive collections of operators
Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
Robustly Solvable Constraint Satisfaction Problems
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Reconstructing the topology of clones
ON SEMITRANSITIVE JORDAN ALGEBRAS OF MATRICES
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Generic Automorphisms of Homogeneous Structures
Constraint Satisfaction with Countable Homogeneous Templates
The complexity of temporal constraint satisfaction problems
Orbits of Permutation Groups on Unordered Sets, II
On the Reconstruction of ℵ₀ -Categorical Structures from their Automorphism Groups
Autour De La Propriété Du Petit Indice
PROJECTIVE CLONE HOMOMORPHISMS
A Proof of the CSP Dichotomy Conjecture
Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals
Reconstructing structures with the strong small index property up to bi-definability
Cores of Countably Categorical Structures
Classifying the Complexity of Constraints Using Finite Algebras
The Complexity of Phylogeny Constraint Satisfaction Problems
On semitransitive Lie algebras of minimal dimension
Reconstruction of homogeneous relational structures
Topological Birkhoff
Notes on infinite permutation groups

This page was built for publication: On a stronger reconstruction notion for monoids and clones