Results 51 to 60 of about 348 (168)
Galois Connections in Categorial Type Logic
Electronic 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
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
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 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
On the fixed‐point proportion of self‐similar groups
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley +1 more source
Galois Connections: Mathematics, Art, and Archives [PDF]
Electronic Workshops in Computing, 2015 Evariste Galois (1811--1832) has been increasingly recognised as an important mathematician who despite his short life developed mathematical ideas that today have applications in computer science (such as Galois connections) and elsewhere. Some of Galois' mathematics can be visualised in interesting and even artistic ways, aided using software.
Jonathan P. Bowen, Tula Giannini
openaire +2 more sources
ComputersIrreducible 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]
Logical Methods in Computer ScienceWe 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
Quasi‐convex surface subgroups in some one‐relator groups with torsion
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley +1 more source
An elegant model of the geodesic flow on the modular surface
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley +1 more source
A Constructive Framework for Galois Connections
CoRR, 2017 Abstract interpretation-based static analyses rely on abstract domains of program properties, such as intervals or congruences for integer variables. Galois connections (GCs) between posets provide the most widespread and useful formal tool for mathematically specifying abstract domains.
openaire +2 more sources