相关论文: Constructive Galois Connections: Taming the Galois…
Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…
We establish a Galois connection between sub-monads of an augmented monad and sub-functors of the forgetful functor from its Eilenberg-Moore category. This connection is given in terms of invariants and stabilizers defined through universal…
We study the basic Galois connection induced by the "satisfaction" relation between external operations $A^n\rightarrow B$ defined on a set $A$ and valued in a possibly different set $B$ on the one hand, and ordered pairs $(R,S)$ of…
Over 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. In this paper, we employ a completely algebraic variation of…
Family-based (lifted) data-flow analysis for Software Product Lines (SPLs) is capable of analyzing all valid products (variants) without generating any of them explicitly. It takes as input only the common code base, which encodes all…
It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations $f\colon B^n\to B$, and classes (coclones) of…
The theory of general Galois-type extensions is presented, including the interrelations between coalgebra extensions and algebra (co)extensions, properties of corresponding (co)translation maps, and rudiments of entwinings and…
This paper concerns the development of metatheory for extensible languages. It uses as its starting point a view that programming languages tailored to specific application domains are to be constructed by composing components from an open…
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
This paper is dedicated to the differential Galois theory in the complex analytic context for Lie-Vessiot systems. Those are the natural generaliza- tion of linear systems, and the more general class of differential equations adimitting…
The fundamental concepts in the Galois Theory are separable, normal and Galois field extensions. These concepts are central in proofs of the Galois Theory. In the paper, we introduce a new approach, a ring theoretic approach, to the Galois…
Mechanistic interpretability aims to reverse engineer the computation performed by a neural network in terms of its internal components. Although there is a growing body of research on mechanistic interpretation of neural networks, the…
We explore connections between birational anabelian geometry and abstract projective geometry. One of the applications is a proof of a version of the birational section conjecture.
Mechanistic interpretability aims to reverse engineer neural networks by uncovering which high-level algorithms they implement. Causal abstraction provides a precise notion of when a network implements an algorithm, i.e., a causal model of…
Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be…
Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give high-level, modular, and formal specifications of many important judgments in the area of programming languages…
We introduce an abstract topos-theoretic framework for building Galois-type theories in a variety of different mathematical contexts; such theories are obtained from representations of certain atomic two-valued toposes as toposes of…
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying…
The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and…
We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative…