Related papers: Mathematical Theory Exploration in Theorema: Reduc…

This article revisits standard theorems from elementary number theory from a constructive, algorithmic, and proof-theoretic perspective, framed within the theory of computable functionals TCF. Key examples include B\'ezout's identity, the…

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

The theory of Groebner Bases originated in the work of Buchberger and is now considered to be one of the most important and useful areas of symbolic computation. A great deal of effort has been put into improving Buchberger's algorithm for…

In this paper, we study the consequences of the fundamental theorem of calculus from an algebraic point of view. For functions with singularities, this leads to a generalized notion of evaluation. We investigate properties of such…

Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…

We develop the basic theory of geometrically closed rings as a generalisation of algebraically closed fields, on the grounds of notions coming from positive model theory and affine algebraic geometry. For this purpose we consider several…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.

The famous F5 algorithm for computing Gr\"obner basis was presented by Faug\`ere in 2002 without complete proofs for its correctness. The current authors have simplified the original F5 algorithm into an F5 algorithm in Buchberger's style…

This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…

This is an introduction to rings and fields, written for a quarter-long undergraduate course. It includes the basic properties of ideals, modules, algebras and polynomials, the constructions of ring extensions and finite fields, some…

Tate algebras are fundamental objects in the context of analytic geometry over the p-adics. Roughly speaking, they play the same role as polynomial algebras play in classical algebraic geometry. In the present article, we develop the…

Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly…

This paper deals with the notion of Gr\"obner $\delta$-base for some rings of linear differential operators by adapting the works of W. Trinks, A. Assi, M. Insa and F. Pauer. We compare this notion with the one of Gr\"obner base for such…

We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.

Resolution and superposition are common techniques which have seen widespread use with propositional and first-order logic in modern theorem provers. In these cases, resolution proof production is a key feature of such tools; however, the…

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…