Results 151 to 160 of about 19,730 (191)

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\).
Domenach, Florent, Leclerc, Bruno
openaire   +1 more source

Duality for Quasilattices and Galois Connections

Fundamenta Informaticae, 2017
The primary goal of the paper is to establish a duality for quasilattices. The main ingredients are duality for semilattices and their representations, the structural analysis of quasilattices as Płonka sums of lattices, and the duality for lattices developed by Hartonas and Dunn.
Romanowska, Anna B., Smith, Jonathan D. H.   +1 more
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

Triadic fuzzy Galois connections as ordinary connections

Fuzzy Sets and Systems, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belohlavek, Radim, Osicka, Petr
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 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

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, A. C. Melton, G. E. Strecker   +2 more
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   +3 more sources

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, Michał Terepeta, Hanne Riis Nielson, Flemming Nielson   +3 more
openaire   +1 more source

Generalizations and Galois-Tukey Connections

2013
It is possible to see the hat problem on the parity relation as actually being a two-agent hat problem, though we must consider a more general type of hat problem; in doing so, we uncover a close relationship with so-called Galois-Tukey connections. In this final chapter, we explore the relationships between results extending those in Chapter 4 and ...
Christopher S. Hardin, Alan D. Taylor
openaire   +1 more source