Loading [a11y]/accessibility-menu.js
The proof complexity of linear algebra | IEEE Conference Publication | IEEE Xplore

The proof complexity of linear algebra


Abstract:

We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the su...Show More

Abstract:

We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the first feasible proofs of the Cayley-Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities.
Date of Conference: 22-25 July 2002
Date Added to IEEE Xplore: 07 November 2002
Print ISBN:0-7695-1483-9
Print ISSN: 1043-6871
Conference Location: Copenhagen, Denmark

References

References is not available for this document.