Results 141 to 150 of about 349 (167)
Some of the next articles are maybe not open access.

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   +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

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

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

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   +3 more
openaire   +1 more source

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

GALOIS REPRESENTATIONS CONNECTED WITH HYPERBOLIC CURVES

Mathematics of the USSR-Izvestiya, 1992
In 1983 Grothendieck formulated the so-called ``fundamental conjectures of the unabelian geometry''. The author defines the concept of elementary unabelian variety and considers the Grothendieck conjectures in this special setting, by studying the actions of the Galois groups on the fundamental groups of curves.
openaire   +2 more sources

Home - About - Disclaimer - Privacy