Two examples of Galois connections and their dual forms are considered. One of them is applied to formulate a criterion when a given subset of a complete lattice forms a complete lattice. The second, closely related to the first, is used to prove in a short way the Knaster-Tarski’s fixed point theore
By using the closure–interior Galois connection and the box product of relations, we show that the d...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
Given two closure spaces (E,j) and (E',j'), a relation R inclue dans E x E' is said biclosed if ever...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
I give short and constructive proofs of Tarski’s fixed-point theorem, and of Zhou’s extension of Tar...
We propose a method to characterize the fixed points described in Tarski's theorem for complete latt...
Tarski\u27s fixed point theorem for complete lattices is a fundamental theorem in lattice theory and...
In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic charact...
AbstractThe (isotone) map f: X → X is an increasing (decreasing) operator on the poset X if f(x) ⩽ f...
AbstractIn this paper we propose a basic fixed-point theorem for correspondences inspired by Tarski'...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
For every positive integer n,we introduce and discuss an isotone Galois connection between the sets ...
Lattice-Ordered Stone Spaces are shown to be the dual spaces of partial orders or meet semilattices....
Summary. In the paper, we investigate the duality of categories of complete lattices and maps preser...
summary:The purpose of this paper is to study conditions under which the restriction of a certain Ga...
By using the closure–interior Galois connection and the box product of relations, we show that the d...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
Given two closure spaces (E,j) and (E',j'), a relation R inclue dans E x E' is said biclosed if ever...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
I give short and constructive proofs of Tarski’s fixed-point theorem, and of Zhou’s extension of Tar...
We propose a method to characterize the fixed points described in Tarski's theorem for complete latt...
Tarski\u27s fixed point theorem for complete lattices is a fundamental theorem in lattice theory and...
In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic charact...
AbstractThe (isotone) map f: X → X is an increasing (decreasing) operator on the poset X if f(x) ⩽ f...
AbstractIn this paper we propose a basic fixed-point theorem for correspondences inspired by Tarski'...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
For every positive integer n,we introduce and discuss an isotone Galois connection between the sets ...
Lattice-Ordered Stone Spaces are shown to be the dual spaces of partial orders or meet semilattices....
Summary. In the paper, we investigate the duality of categories of complete lattices and maps preser...
summary:The purpose of this paper is to study conditions under which the restriction of a certain Ga...
By using the closure–interior Galois connection and the box product of relations, we show that the d...
AbstractIt is shown that the least fixed point and greatest fixed point operations of an increasing ...
Given two closure spaces (E,j) and (E',j'), a relation R inclue dans E x E' is said biclosed if ever...