Results 21 to 30 of about 1,175,834 (208)
Galois connections between sets of paths and closure operators in simple graphs
Open Mathematics, 2018 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
A domain-theoretic investigation of posets of sub-sigma-algebras (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 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]
AUT Journal of Mathematics and Computing, 2020 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
Self-Dual Normal Basis of a Galois Ring
Journal of Mathematics, 2014 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)
International Journal of Mathematics and Mathematical Sciences, 2011 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
A Galois connection for weighted (relational) clones of infinite size [PDF]
, 2016 A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs).
core +1 more source
A galois connection calculus for abstract interpretation
, 2014 International audienceWe introduce a Galois connection calculus for language independent specification of abstract interpretations used in programming language semantics, formal verification, and static analysis.
Patrick` Cousot +3 more
core +1 more source
ESSENTIAL AND RETRACTABLE GALOIS CONNECTIONS [PDF]
Journal of Algebra and Its Applications, 2013 For bounded lattices, we introduce certain Galois connections, called (cyclically) essential, retractable and UC Galois connections, which behave well with respect to concepts of module-theoretic nature involving essentiality. We show that essential retractable Galois connections preserve uniform dimension, whereas essential retractable UC Galois ...
openaire +2 more sources
Involutions on Relational Program Calculi [PDF]
Scientific 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
Connections on trivial vector bundles over projective schemes
Comptes Rendus. MathématiqueOver 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