Related papers: A Constructive Framework for Galois Connections
The classical Galois theory deals with certain finite algebraic extensions and establishes a bijective order reversing correspondence between the intermediate fields and the subgroups of a group of permutations called the Galois group of…
We give model theoretic accounts and proofs of the existence and uniqueness of differential Galois extensions with no new constants, for logarithmic differential equations over a differential field K, when the field C of constants of K is…
Two adjoint functors can be seen as generalisations of the two functions within a Galois connection. If instead the adjoints are not generalised from functions, but from relations, then analogously the object of study becomes a more general…
Let $A$ be a unital associative algebra over a field $k$. All unital associative algebras containing $A$ as a subalgebra of a given codimension $\mathfrak{c}$ are described and classified. For a fixed vector space $V$ of dimension…
We compare several definitions of the Galois group of a linear difference equation that have arisen in algebra, analysis and model theory and show, that these groups are isomorphic over suitable fields. In addition, we study properties of…
The notion of `Pseudo Algebraically Closed (PAC) extensions' is a generalization of the classical notion of PAC fields. It was originally motivated by Hilbert's tenth problem, and recently had new applications. In this work we develop 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…
The main purpose of this paper is to provide explicit computations of the fundamental group of several algebras. For this purpose, given a $k$-algebra $A$, we consider the category of all connected gradings of $A$ by a group $G$ and we…
Let F be a differential field of characteristic zero. In this article, we construct Picard-Vessiot extensions of F whose differential Galois group is isomorphic to the full unipotent subgroup of the upper triangular group defined over the…
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…
We give a constructive account of the de Groot duality of stably compact spaces in the setting of strong proximity lattice, a point-free representation of a stably compact space. To this end, we introduce a notion of strong continuous…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
This paper presents a new numerical abstract domain for static analysis by abstract interpretation. This domain allows us to represent invariants of the form (x-y<=c) and (+/-x<=c), where x and y are variables values and c is an integer or…
Given a braided tensor *-category C with conjugate (dual) objects and irreducible unit together with a full symmetric subcategory S we define a crossed product C\rtimes S. This construction yields a tensor *-category with conjugates and an…
Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models that capture the…
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…
The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this paper, we consider a core imperative language that has several…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
Causal abstractions allow us to relate causal models on different levels of granularity. To ensure that the models agree on cause and effect, frameworks for causal abstractions define notions of consistency. Two distinct methods for causal…
Abstraction is a commonly used process to represent some low-level system by a more coarse specification with the goal to omit unnecessary details while preserving important aspects. While recent work on abstraction in the situation…