Results 141 to 150 of about 888,944 (169)

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

A Diagram of Galois Connections of Functorial Topologies

Applied Categorical Structures, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabriele Castellini, Stan Dziobiak
openaire   +2 more sources

Logical Relations and Galois Connections

2002
Algebraic properties of logical relations on partially ordered sets are studied. It is shown how to construct a logical relation that extends a collection of base Galois connections to a Galois connection of arbitrary higher-order type. "Theorems-for-free" is used to show that the construction ensures safe abstract interpretation of parametrically ...
Kevin Backhouse, Roland Carl Backhouse
openaire   +2 more sources

On Galois Connections and Soft Computing

2013
After recalling the different interpretations usually assigned to the term Galois connection, both in the crisp and in the fuzzy case, we survey on several of their applications in Computer Science and specifically, in Soft Computing.
Francisca García-Pardo, Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego   +3 more
openaire   +2 more sources

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.
M. ERNÉ, J. KOSLOWSKI, A. MELTON, G. E. STRECKER   +3 more
openaire   +1 more source

Galois Connections and Pair Algebras

Canadian Journal of Mathematics, 1969
Unless further restricted, P, Q, and R denote arbitrary partially ordered sets whose order relations are all written “≦” .An isotone mapping ϕ: P → Q is said to be residuated if there is an isotone mapping ψ: Q → P such that(RM 1) xϕψ ≧ x for all x i n P;(RM 2) yψϕ ≦ for all y in Q.Let Q* denote the partially ordered set with order relation dual to ...
openaire   +2 more sources

Galois Connections in Axiomatic Aggregation

2011
We investigate the relations between, on the one hand, Galois connections and the related types of maps and, on the other hand, the axiomatic Arrowian approach for the aggregation (or consensus) problem in lattices. In the latter one wants to "aggregate" n-tuples (n ≥ 2) of elements of a lattice L into an element of this lattice representing their ...
openaire   +1 more source

On the structure of cross connections and Galois connections

Korean Journal of Computational & Applied Mathematics, 1995
We consider partially ordered set as passing from the set of ideals to the set of filters in Cartesian product of partially ordered sets. Lawson introduced the concept of cross connection with the ideal and filter. We show the relation between Galois connection and cross connection.
openaire   +1 more source

Non-constructive Galois-Tukey connections

Journal of Symbolic Logic, 1997
AbstractThere are inequalities between cardinal characteristics of the continuum that are true in any model of ZFC, but without a Borel morphism proving the inequality. We answer some questions from Blass [1].
openaire   +4 more sources

Galois connections and data analysis

Fundam. Informaticae, 2004
Summary: We investigate Galois connections and their relations to the major theories of (qualitative) data analysis: Rough Set Theory (RST), Formal Concept Analysis (FCA) and John Stuart Mill Reasoning (JSM-Reasoning). Polarities, a type of contravariant Galois connections, and their relationships with data analysis has been already well-known.
openaire   +2 more sources