By using the closure–interior Galois connection and the box product of relations, we show that the duals of some of our former theorems on the relational equation R = G−1◦ S ◦ F and inclusion R ⊆ G−1◦ S ◦ F can be easily derived from some simple basic facts on Galois connections. To clarify the importance of this subject, we recall that a relation F on a set X is called regular (normal) if F = F ◦ S ◦ F F = F ◦ S ◦ (F c )−1 for some relation S on X. Note that here S may, for instance, be the identity relation of X or the inverse relation of F . Thus, in particular, all idempotent and non-mingled-valued relations are regular. Moreover, a pair ( F , G) of relations is called properly (uniformly) mildly continuous, with respect to the relati...
The general Galois theory for functions and relational constraints over arbitrary sets described in ...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
We study the basic Galois connection induced by the ``satisfaction" relation between external operat...
In this paper, we investigate the properties of Galois, dual Galois, residuated and dual residuated ...
Most studies of Galois connections begin with a function and ask the question: when is there a secon...
Given two closure spaces (E,j) and (E',j'), a relation R inclue dans E x E' is said biclosed if ever...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
We investigate the properties of Galois, dual Galois, residuated, and dual residuated connections on...
ii Using the the dependently-typed programming language Agda, we formalise orders, with attention to...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
Pippenger’s Galois theory of finite functions and relational constraints is ex- tended to the infinit...
We discuss some new properties of the natural Galois connection among set relation algebras, permuta...
summary:In a former paper, motivated by a recent theory of relators (families of relations), we have...
AbstractThe Galois connection given in 1985 by Pumplün and Röhrl between the classes of objects and ...
The general Galois theory for functions and relational constraints over arbitrary sets described in ...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
We study the basic Galois connection induced by the ``satisfaction" relation between external operat...
In this paper, we investigate the properties of Galois, dual Galois, residuated and dual residuated ...
Most studies of Galois connections begin with a function and ask the question: when is there a secon...
Given two closure spaces (E,j) and (E',j'), a relation R inclue dans E x E' is said biclosed if ever...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
We investigate the properties of Galois, dual Galois, residuated, and dual residuated connections on...
ii Using the the dependently-typed programming language Agda, we formalise orders, with attention to...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
Pippenger’s Galois theory of finite functions and relational constraints is ex- tended to the infinit...
We discuss some new properties of the natural Galois connection among set relation algebras, permuta...
summary:In a former paper, motivated by a recent theory of relators (families of relations), we have...
AbstractThe Galois connection given in 1985 by Pumplün and Röhrl between the classes of objects and ...
The general Galois theory for functions and relational constraints over arbitrary sets described in ...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...