English
Related papers

Related papers: $S$-preclones and the Galois connection ${}^S\math…

200 papers

Preclones are described as the closed classes of the Galois connection induced by a preservation relation between operations and matrix collections. The Galois closed classes of matrix collections are also described by explicit closure…

Rings and Algebras · Mathematics 2016-11-22 Erkko Lehtonen

We propose a classification of symmetric conservative clones with a finite carrier. For the study, we use the functional Galois connection $(Inv_Q, Pol_Q)$, which is a natural modification of the connection $(Inv, Pol)$ based on the…

Logic · Mathematics 2018-10-09 Nikolay L. Polyakov

We study the basic Galois connection induced by the "satisfaction" relation between external operations $A^n\rightarrow B$ defined on a set $A$ and valued in a possibly different set $B$ on the one hand, and ordered pairs $(R,S)$ of…

Rings and Algebras · Mathematics 2015-08-10 Miguel Couceiro

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is…

Information Theory · Computer Science 2016-02-22 A. Fotue Tabue , E. Martínez-Moro , C. Mouaha

We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative…

Rings and Algebras · Mathematics 2022-10-13 Mike Behrisch

It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations $f\colon B^n\to B$, and classes (coclones) of…

Logic · Mathematics 2018-04-24 Emil Jeřábek

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

Computational Complexity · Computer Science 2016-05-31 Peter Fulla , Stanislav Zivny

We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…

Logic · Mathematics 2025-12-02 Vojtěch David , Dmitriy Zhuk

Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) $\rho$ have the property that an $n$-ary operation $f$ preserves $\rho$, i.e., $f$ is a polymorphism of $\rho$, if and only if each…

Rings and Algebras · Mathematics 2023-07-06 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen

We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…

Logic · Mathematics 2016-06-22 Jonah Maissel , Matatyahu Rubin

In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…

Rings and Algebras · Mathematics 2015-08-10 Miguel Couceiro

Let $\mathsf{PreOrd}(\mathbb C)$ be the category of internal preorders in an exact category $\mathbb C$. We show that the pair $(\mathsf{Eq}(\mathbb C), \mathsf{ParOrd}(\mathbb C))$ is a pretorsion theory in $\mathsf{PreOrd}(\mathbb C)$,…

Category Theory · Mathematics 2020-03-09 Alberto Facchini , Carmelo Finocchiaro , Marino Gran

In this article, we prove infinitary version of one to one correspondence theorem between clones and relational clones on a fixed possibly infinite set. We also characterize the relational clone corresponding to the clone of all finitary…

Logic · Mathematics 2013-10-08 Shohei Izawa

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois…

Number Theory · Mathematics 2023-12-25 Francesca Balestrieri , Jennifer Park , Alexandra Shlapentokh

Quasiorders $\varrho\subseteq A^{2}$ have the property that an operation $f:A^{n}\to A$ preserves $\varrho$ if and only if each (unary) translation obtained from $f$ is an endomorphism of $\rho$. Generalized quasiorders $\rho\subseteq A^{m}…

General Mathematics · Mathematics 2025-11-04 D. Jakubíková-Studenovská , R. Pöschel , S. Radeleczki

We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior…

Logic · Mathematics 2012-03-23 Francesco Ciraulo , Giovanni Sambin

Given a braided tensor *-category C with conjugate (dual) objects and irreducible unit together with a full symmetric subcategory S we define a crossed product C\rtimes S. This construction yields a tensor *-category with conjugates and an…

Category Theory · Mathematics 2007-05-23 Michael Mueger

In this paper we define operations of preradicals of any abelian category. We define idempotent preradicals and radicals. We prove that every adjoint pair between abelian categories induces a Galois connection between the corresponding…

Analogical proportions are 4-ary relations that read "A is to B as C is to D". Recent works have highlighted the fact that such relations can support a specific form of inference, called analogical inference. This inference mechanism was…

Artificial Intelligence · Computer Science 2022-05-11 Miguel Couceiro , Erkko Lehtonen
‹ Prev 1 2 3 10 Next ›