Logic in Computer Science, Symposium on (2002)
July 22, 2002 to July 25, 2002
Stephen Cook , University of Toronto
Michael Soltys , McMaster University
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.
Stephen Cook, Michael Soltys, "The Proof Complexity of Linear Algebra", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 335, 2002, doi:10.1109/LICS.2002.1029841