Results 131 to 140 of about 348 (168)

A category of Galois connections

1987
We study Galois connections by examining the properties of three categories. The objects in each category are Galois connections. The categories differ in their hom-sets; in the most general category the morphisms are pairs of functions which commute with the maps of the domain and codomain Galois connections. One of our main results is that one of the
J. M. McDill, Austin Melton, George E. Strecker   +2 more
openaire   +2 more sources

A Galois Connection

Logica Universalis, 2007
The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other.
openaire   +1 more source

A Primer on Galois Connections

Annals of the New York Academy of Sciences, 1993
ABSTRACT. The rudiments of the theory of Galois connections (or residuation theory, as it is sometimes called) are provided, together with many examples and applications. Galois connections occur in profusion and are well known to most mathematicians who deal with order theory; they seem to be less known to topologists.
G E Strecker
exaly   +2 more sources

Armstrong systems and Galois connections

2011 IEEE International Conference on Granular Computing, 2011
In the paper [1], it is proved that any Galois connection (f, g) on a complete lattice made an Armstrong system F (f, g) . We prove in this short note that the converse holds, that is, for a given Armstrong system R, we can make a Galois connection (φ R , ψ R ) and the original Armstrong system R is identical with the induced Armstrong system F (φR, ψR)
Michiro Kondo, Sho Soneda, Bunpei Yoshii
openaire   +2 more sources

Relational fuzzy Galois connections

2017 Joint 17th World Congress of International Fuzzy Systems Association and 9th International Conference on Soft Computing and Intelligent Systems (IFSA-SCIS), 2017
We propose a suitable generalization of the notion of Galois connection whose components are fuzzy relations. We prove that the construction embeds Yao's notion of fuzzy Galois connection as a particular case. Although the natural framework for the proposed notion is that of fuzzy preposets, we also prove that it behaves properly with respect to the ...
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego   +2 more
openaire   +2 more sources

Relational Galois Connections

2007
Galois connections can be defined for lattices and for ordered sets. We discuss a rather wide generalisation, which was introduced by Weiqun Xia and has been reinvented under different names: Relational Galois connections between relations. It turns out that the generalised notion is of importance for the original one and can be utilised, e.g., for ...
openaire   +1 more source

Galois Connections for Flow Algebras

2011
We generalise Galois connections from complete lattices to flow algebras. Flow algebras are algebraic structures that are less restrictive than idempotent semirings in that they replace distributivity with monotonicity and dispense with the annihilation property; therefore they are closer to the approach taken by Monotone Frameworks and other classical
Piotr Filipiuk, Michal Terepeta, Hanne Riis Nielson, Flemming Nielson   +3 more
openaire   +1 more source

Triadic fuzzy Galois connections as ordinary connections

Fuzzy Sets and Systems, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Radim Belohlávek, Petr Osicka
openaire   +3 more sources

A Relational Extension of Galois Connections

2019
In this paper, we focus on a twofold relational generalization of the notion of Galois connection. It is twofold because it is defined between sets endowed with arbitrary transitive relations and, moreover, both components of the connection are relations as well.
Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego   +3 more
openaire   +1 more source

Biclosed Binary Relations and Galois Connections

Order, 2001
A biclosed relation between two closure spaces \(E\) and \(E'\) is a binary relation \(R\subseteq E\times E'\) with every row of its matrix representation corresponding to a closed subset of \(E'\) and every column corresponding to a closed subset of \(E\).
Florent Domenach, Bruno Leclerc
openaire   +2 more sources