281 search results - page 1 / 57 » The Proof Complexity of Linear Algebra |
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
DAM
2007
13 years 4 months ago
2007
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...