Weak theories of linear algebra

DOI10.1007/s00153-004-0249-8zbMath1064.03037OpenAlexW1987241097MaRDI QIDQ1766923

Michael Soltys, Neil Thapen

Publication date: 2 March 2005

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-004-0249-8

zbMATH Keywords

bounded arithmeticlinear algebracomplexity of proofsGaussian elimination algorithmcommutativity of matrix inverseFrege propositional proof systempolynomial time reasoningpolysize Frege proof

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Commutativity of matrices (15A27) First-order arithmetic and fragments (03F30) Complexity of proofs (03F20)

Related Items

Proving properties of matrices over \({\mathbb{Z}_{2}}\)

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• The proof complexity of linear algebra
• A taxonomy of problems with fast parallel algorithms
• Notes on polynomially bounded arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item