Results 21 to 30 of about 12,528 (136)
Hennessy-Milner Theorems via Galois Connections
We introduce a general and compositional, yet simple, framework that allows us to derive soundness and expressiveness results for modal logics characterizing behavioural equivalences or metrics (also known as Hennessy-Milner theorems). It is based on Galois connections between sets of (real-valued) predicates on the one hand and equivalence relations ...
Beohar, H. +3 more
openaire +5 more sources
Logics from Galois connections
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Järvinen, Jouni +2 more
openaire +2 more sources
Relation-based Galois connections: towards the residual of a relation [PDF]
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego, Relation-based Galois connections: towards the residual of a relation, CMMSE 2017: Proceedings of the 17th International Conference on Mathematical Methods in Science and Engineering ( ISBN: 978-84-617-
Cabrera, Inma P. +2 more
core
Projective module description of the q-monopole
The Dirac q-monopole connection is used to compute projector matrices of quantum Hopf line bundles for arbitrary winding number. The Chern-Connes pairing of cyclic cohomology and K-theory is computed for the winding number -1.
Hajac, P. M., Majid, S.
core +2 more sources
Counting Proper Mergings of Chains and Antichains
A proper merging of two disjoint quasi-ordered sets $P$ and $Q$ is a quasi-order on the union of $P$ and $Q$ such that the restriction to $P$ and $Q$ yields the original quasi-order again and such that no elements of $P$ and $Q$ are identified.
Borchmann +12 more
core +1 more source
Moduli spaces of irregular singular connections
In the geometric version of the Langlands correspondence, irregular singular point connections play the role of Galois representations with wild ramification.
Bremer, Christopher L., Sage, Daniel S.
core +1 more source
Injecting Abstract Interpretations into Linear Cost Models
We present a semantics based framework for analysing the quantitative behaviour of programs with regard to resource usage. We start from an operational semantics equipped with costs.
Cachera, David, Jobin, Arnaud
core +2 more sources
Tight Galois Connections and Complete Distributivity [PDF]
and discusses its relations with the property of complete distributivity in complete lattices. A procedure for constructing Galois connections between complete lattices is presented. The Galois connections constructed by this procedure are called tight Galois connections, and are characterized as those which satisfy certain identities.
openaire +2 more sources
Galois Connections and Applications [PDF]
Preface M. Erne Adjunctions and Galois Connections: Origins, History and Development G. Janelidze Categorical Galois Theory: Revision and Some Recent Developments M. Erne The Polarity between Approximation and Distribution K. Denecke, S.L. Wismath Galois Connections and Complete Sublattices R.
openaire +1 more source
Galois cohomology of SO(N)-connections
Abstract Two different types of Fuchsian function of the second kind are possible for SU(2)-bundle on U(1)-flat-connections of Chern-Simons field. Both of two different types of Fuchsian are parametrized by the same moduli as the LF-invariant measure situated on arbitrary Galois cohomology.
openaire +1 more source

