Results 11 to 20 of about 298 (123)
Galois connections between sets of paths and closure operators in simple graphs
For every positive integer n,we introduce and discuss an isotone Galois connection between the sets of paths of lengths n in a simple graph and the closure operators on the (vertex set of the) graph.
Šlapal Josef
doaj +1 more source
An Explanation of the Landauer bound and its ineffectiveness with regard to multivalued logic
We discuss, using recent results on the thermodynamics of multivalued logic, the difficulties and pitfalls of how to apply the Landauer’s principle to thermodynamic computer memory models. The presentation is based on Szilard’s version of Maxwell’s demon
Kycia Radosław A. +1 more
doaj +1 more source
A domain-theoretic investigation of posets of sub-sigma-algebras (extended abstract) [PDF]
Given a measurable space (X, M) there is a (Galois) connection between sub-sigma-algebras of M and equivalence relations on X. On the other hand equivalence relations on X are closely related to congruences on stochastic relations.
Ingo Battenfeld
doaj +1 more source
New directions in general fuzzy automata: a dynamic-logical view [PDF]
In the current study, by a general fuzzy automaton we aim at showing a set of propositions related to a given automaton showing that the truth-values are depended on thestates, inputs and membership values of active states at time t.
Khadijeh Abolpour +2 more
doaj +1 more source
Computing character degrees via a Galois connection [PDF]
In a previous paper, the second author established that, given finite fields ...
Mark L. Lewis , John K. McVey
doaj
Self-Dual Normal Basis of a Galois Ring
Let R′=GR(ps,psml) and R=GR(ps,psm) be two Galois rings. In this paper, we show how to construct normal basis in the extension of Galois rings, and we also define weakly self-dual normal basis and self-dual normal basis for R′ over R, where R′ is ...
Irwansyah +3 more
doaj +1 more source
The Order of Hypersubstitutions of Type (2,1)
Hypersubstitutions are mappings which map operation symbols to terms of the corresponding arities. They were introduced as a way of making precise the concept of a hyperidentity and generalizations to 𝑀-hyperidentities.
Tawhat Changphas, Wonlop Hemvong
doaj +1 more source
The minimal closed monoids for the Galois connection ${\rm End}$-${\rm Con}$ [PDF]
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
Involutions on Relational Program Calculi [PDF]
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
Connections on trivial vector bundles over projective schemes
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

