We present a formalization of coherent and strongly discrete rings in type theory. This is a fundamental structure in constructive algebra that represents rings in which it is possible to solve linear systems of equations. These structures have been instantiated with B\ue9zout domains (for instance Z and k[x]) and Pr\ufcfer domains (generalization of Dedekind domains) so that we get certified algorithms solving systems of equations that are applicable on these general structures. This work can be seen as basis for developing a formalized library of linear algebra over rings
Although unification algorithms have been developed for numerous equational theories there is still ...
We have developed powerful environments within the Nuprl Proof Development System for problem solvi...
This book combines, in a novel and general way, an extensive development of the theory of families o...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
This book provides the first extensive and systematic treatment of the theory of commutative coheren...
The solved theories of the ring varieties are investigated. The existence of the finite-based variet...
In this paper we construct a category of effective noetherian rings in which linear equations can be...
In this note we develop a theory of formal schemes and groups over arbitrary commutative rings which...
AbstractWe show, in constructive mathematics, that if k is a discrete field and f an arbitrary polyn...
Translated from the popular French edition, this book offers a detailed introduction to various basi...
AbstractIn this paper, we present new mathematical results and several new algorithm for solving a s...
A commutative ring is called coherent if the intersection of any two finitely generated ideals is fi...
We investigate the equational fragments of formal systems for arithmetic by means of the equational ...
AbstractWe give a new constructive definition for Noetherian rings. It has a very concrete statement...
The object of this work is to offer algorithm how can be solved systems of linear equations Ax=b ove...
Although unification algorithms have been developed for numerous equational theories there is still ...
We have developed powerful environments within the Nuprl Proof Development System for problem solvi...
This book combines, in a novel and general way, an extensive development of the theory of families o...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
This book provides the first extensive and systematic treatment of the theory of commutative coheren...
The solved theories of the ring varieties are investigated. The existence of the finite-based variet...
In this paper we construct a category of effective noetherian rings in which linear equations can be...
In this note we develop a theory of formal schemes and groups over arbitrary commutative rings which...
AbstractWe show, in constructive mathematics, that if k is a discrete field and f an arbitrary polyn...
Translated from the popular French edition, this book offers a detailed introduction to various basi...
AbstractIn this paper, we present new mathematical results and several new algorithm for solving a s...
A commutative ring is called coherent if the intersection of any two finitely generated ideals is fi...
We investigate the equational fragments of formal systems for arithmetic by means of the equational ...
AbstractWe give a new constructive definition for Noetherian rings. It has a very concrete statement...
The object of this work is to offer algorithm how can be solved systems of linear equations Ax=b ove...
Although unification algorithms have been developed for numerous equational theories there is still ...
We have developed powerful environments within the Nuprl Proof Development System for problem solvi...
This book combines, in a novel and general way, an extensive development of the theory of families o...