Related papers: Formalising Sylow's theorems in Coq
We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong L\"ob logic $\sf{iSL}$, an intuitionistic modal logic with a provability interpretation. A…
We focus our attention to the set $\gl{\coring{C}}$ of grouplike elements of a coring $\coring{C}$ over a ring $A$. We do some observations on the actions of the groups $U(A)$ and $\aut{\coring{C}}$ of units of $A$ and of automorphisms of…
These are notes of a seminar given at the 30th International Symposium on the Theory of Elementary Particles, Berlin-Buckow, August 1996. The material is derived from collaborations with E. Cremmer and J.-L. Gervais, and C. Klimcik, and is…
In this paper, we give the rigidity theorem for a log morphism as an extension of a fixed scheme morphism. We also give several applications of the rigidity theorem.
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the…
Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in…
In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in…
The purpose of this second part of the series is to show a technical result on Chow groups of toric varieties. This is a crucial ingredient for the first part.
We propose a geometric setting of the axiomatic mathematical formalism of quantum theory. Guided by the idea that understanding the mathematical structures of these axioms is of similar importance as was historically the process of…
This paper gives a quick overview of the author's recent result that all finitely presented groups are QSF.
The (.)_reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)_reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show…
The notion of cosilting module was recently introduced as a generalization of the concept of cotilting module. In this paper, it is introduced the notion of finitely cosilting module, i.e. a cosilting module with some finitness conditions,…
Formally reasoning about functional programs is supposed to be straightforward and elegant, however, it is not typically done as a matter of course. Reasoning in a proof assistant requires "reimplementing" the code in those tools, which is…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…
The scope of this review is to give a pedagogical introduction to some new calculations and methods developed by the author in the context of quantum groups and their applications. The review is self- contained and serves as a "first aid…
The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wide range of other fields in mathematics. This paper presents…
The first part of this thesis studies the notion of a "quantum representation", introduced by J.-M. Souriau in order to provide a polarization-free characterization of the Lie group representations attached to coadjoint orbits. When the…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…