Results 51 to 60 of about 349 (167)
Hilbert Algebras with Hilbert-Galois Connections II
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
Manin's conjecture for integral points on toric varieties
Abstract We formulate a conjecture on the number of integral points of bounded height on log Fano varieties in analogy with Manin's conjecture on the number of rational points of bounded height on Fano varieties. We also give a prediction for the leading constant that is similar to Peyre's interpretation of the leading constant in Manin's conjecture ...
Tim Santens
wiley +1 more source
Conics Through Inequivalent 5-Arcs in PG(2, 32)
A k-arcs is usually defined to be a set of k points in the projective plane such that some lines meets K in two points. A conic is an irreducible plane quadric curve with six terms.
Zainab Abbas Khalaf +1 more
doaj +1 more source
Study of MV-algebras via derivations
The main goal of this paper is to give some representations of MV-algebras in terms of derivations. In this paper, we investigate some properties of implicative and difference derivations and give their characterizations in MV-algebras.
Wang Jun Tao, She Yan Hong, Qian Ting
doaj +1 more source
Galois Connections in Categorial Type Logic
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
Computing Bonds Between Formal Contexts
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
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova +3 more
doaj +1 more source
Galois connecting call-by-value and call-by-name [PDF]
We establish a general framework for reasoning about the relationship between call-by-value and call-by-name. In languages with computational effects, call-by-value and call-by-name executions of programs often have different, but related, observable ...
Dylan McDermott, Alan Mycroft
doaj +1 more source
Fourier Expansion‐Based Approach to the Parameter Space of Classical Systems
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
FuzzyMind: A Web Platform for End‐to‐End Fuzzy Cognitive Map Modeling
ABSTRACT Fuzzy cognitive maps (FCMs) are widely used for modeling complex causal systems under uncertainty. However, the FCM development lifecycle, encompassing data preprocessing, model construction, weight optimization, and scenario analysis, is typically fragmented across heterogeneous tools.
Theodoros Tziolas, Elpiniki Papageorgiou
wiley +1 more source

