Results 61 to 70 of about 1,175,834 (208)

Galois Connections for Recursive Types

open access: yes, 2020
Building a static analyser for a real language involves modeling of large domains capturing the many available data types. To scale domain design and support efficient development of project-specific analyzers, it is desirable to be able to build, extend, and change abstractions in a systematic and modular fashion.
Ahmad Salim Al-Sibahi   +3 more
openaire   +3 more sources

Antitone Galois Connections and Formal Concepts [PDF]

open access: yesInternational Journal of Fuzzy Logic and Intelligent Systems, 2010
In this paper, we investigate the properties of antitone Galois connection and formal concepts. Moreover, we show that order reverse generating maps induce formal, attribute oriented and object oriented concepts on a complete residuated lattice.
Jung Mi Ko, Yong Chan Kim
openaire   +2 more sources

A Lattice-Theoretic Approach to Multigranulation Approximation Space

open access: yesThe Scientific World Journal, 2014
In this paper, we mainly investigate the equivalence between multigranulation approximation space and single-granulation approximation space from the lattice-theoretic viewpoint.
Xiaoli He, Yanhong She
doaj   +1 more source

Computing Bonds Between Formal Contexts

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 11, Page 11661-11677, 30 July 2026.
ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón   +2 more
wiley   +1 more source

Logics from Galois connections

open access: yesInternational Journal of Approximate Reasoning, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jouni Järvinen   +2 more
openaire   +3 more sources

Hilbert Algebras with Hilbert-Galois Connections II

open access: yesBulletin of the Section of Logic
Hilbert algebra with a Hilbert-Galois connection, or HilGC-algebra, is a triple \(\left(A,f,g\right)\) where \(A\) is a Hilbert algebra, and \(f\) and \(g\) are unary maps on \(A\) such that \(f(a)\leq b\) iff \(a\leq g(b)\), and \(g(a\rightarrow b)\leq ...
Sergio A. Celani, Daniela Montagie
doaj   +1 more source

A Galois connection for valued constraint languages of infinite size

open access: yes, 2015
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).
Peter Fulla, Stanislav Živný
core   +1 more source

Galois Connections in Persistent Homology [PDF]

open access: yes, 2023
We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings.
Gulen, Aziz Burak, McCleary, Alexander
core  

Fourier Expansion‐Based Approach to the Parameter Space of Classical Systems

open access: yesAnnalen der Physik, Volume 538, Issue 7, July 2026.
ABSTRACT We propose a new approach to compute the classical metric tensor (CMT) and the Hannay curvature using Fourier series expansions in action‐angle variables. This approach circumvents the need for complex time‐domain integrals or the construction of generating functions, replacing them with algebraic combinations of Fourier coefficients. We prove
Marcos J. Hernández   +3 more
wiley   +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.
Carlos Areces   +2 more
openaire   +8 more sources

Home - About - Disclaimer - Privacy