Related papers: Constructive Galois Connections
Let $C \subset \mathbb{P}^2$ be a plane curve of degree at least three. A point $P$ in projective plane is said to be Galois if the function field extension induced by the projection $\pi_P: C \dashrightarrow \mathbb P^1$ from $P$ is…
This note illustrates how a variety of causal abstraction arXiv:1707.00819 arXiv:1812.03789, defined here as causal abstractive simulation, can be used to formalize a simple example of language model simulation. This note considers the case…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
Recent progress in deep learning and natural language processing has given rise to powerful models that are primarily trained on a cloze-like task and show some evidence of having access to substantial linguistic information, including some…
We point out the relevance of the Differential Galois Theory of linear differential equations for the exact semiclassical computations in path integrals in quantum mechanics. The main tool will be a necessary condition for complete…
We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…
The notion of a coalgebra-Galois extension is defined as a natural generalisation of a Hopf-Galois extension. It is shown that any coalgebra-Galois extension induces a unique entwining map $\psi$ compatible with the right coaction. For the…
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…
In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can be elegantly…
In this paper we develop a differential Galois theory for algebraic Lie-Vessiot systems in algebraic homogeneous spaces. Lie-Vessiot systems are non autonomous vector fields that are linear combinations with time-dependent coefficients of…
LLM-generated explanations can make technical content more accessible, but there is a ceiling on what they can support interactively. Because LLM outputs are static text, they cannot be executed or stepped through. We argue that grounding…
This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…
The capture calculus is an extension of System F<: that tracks free variables of terms in their type, allowing one to represent capabilities while limiting their scope. While previous calculi had mechanized soundness proofs -- notably…
The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of…
In Proposition I of "Memoire sur les conditions de resolubilite des equations par radicaux", Galois established that any intermediate extension of the splitting field of a polynomial with rational coefficients is the fixed field of its…
The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…
We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…
This tool paper presents Caos: a methodology and a programming framework for computer-aided design of structural operational semantics for formal models. This framework includes a set of Scala libraries and a workflow to produce visual and…
To date, work on formalizing connectionist computation in a way that is at least Turing-complete has focused on recurrent architectures and developed equivalences to Turing machines or similar super-Turing models, which are of more…
The concept of causal abstraction got recently popularised to demystify the opaque decision-making processes of machine learning models; in short, a neural network can be abstracted as a higher-level algorithm if there exists a function…