Results 31 to 40 of about 19,730 (191)

The minimal closed monoids for the Galois connection ${\rm End}$-${\rm Con}$ [PDF]

open access: yesMathematica Bohemica
The minimal nontrivial endomorphism monoids $M={\rm End}{\rm Con} (A,F)$ of congruence lattices of algebras $(A,F)$ defined on a finite set $A$ are described.
Danica Jakubíková-Studenovská   +2 more
doaj   +1 more source

A Proof of Tarski’s Fixed Point Theorem by Application of Galois Connections [PDF]

open access: yes, 2014
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.
A. Tarski   +8 more
core   +1 more source

Lagois connections — a counterpart to Galois connections

open access: yesTheoretical Computer Science, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Melton, Austin   +2 more
openaire   +1 more source

Rough sets based on Galois connections

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2020
Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one.
Madrid Nicolás   +2 more
doaj   +1 more source

Galois Connections in Categorial Type Logic

open access: yesElectronic Notes in Theoretical Computer Science, 2004
AbstractThe introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are order-preserving; in this paper instead, we consider the addition of order-reversing, Galois connected operators. In §2 we do the basic model-theoretic and proof-theoretic groundwork.
C. Areces   +2 more
openaire   +9 more sources

Involutions on Relational Program Calculi [PDF]

open access: yesScientific Annals of Computer Science, 2008
The standard Galois connection between the relational and predicate-transformer models of sequential programming (defined in terms of weakest precondition) confers a certain similarity between them.
I.M. Rewitzky, J.W. Sanders
doaj  

The Chern-Galois character [PDF]

open access: yes, 2003
Following the idea of Galois-type extensions and entwining structures, we define the notion of a principal extension of noncommutative algebras. We show that modules associated to such extensions via finite-dimensional corepresentations are finitely ...
Brzezinski, Tomasz, Hajac, Piotr M.
core   +3 more sources

Connections on trivial vector bundles over projective schemes

open access: yesComptes Rendus. Mathématique
Over a smooth and proper complex scheme, the differential Galois group of an integrable connection may be obtained as the closure of the transcendental monodromy representation.
Biswas, Indranil   +2 more
doaj   +1 more source

The Singular Value Decomposition over Completed Idempotent Semifields

open access: yesMathematics, 2020
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD).
Francisco J. Valverde-Albacete   +1 more
doaj   +1 more source

Parallelisms & Lie Connections [PDF]

open access: yes, 2017
The aim of this article is to study rational parallelisms of algebraic varieties by means of the transcendence of their symmetries. The nature of this transcendence is measured by a Galois group built from the Picard-Vessiot theory of principal ...
Blázquez-Sanz, David, Casale, Guy
core   +4 more sources

Home - About - Disclaimer - Privacy