Weak theories of linear algebra | Archive for Mathematical Logic
Skip to main content
Springer Nature Link
Log in

Weak theories of linear algebra

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

We investigate the theories of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize Frege proofs. We give sentences separating quantified versions of these theories, and define a fragment in which we can interpret a weak theory V1 of bounded arithmetic and carry out polynomial time reasoning about matrices - for example, we can formalize the Gaussian elimination algorithm. We show that, even if we restrict our language, proves the commutativity of inverses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berkowitz, S.J.: On computing the determinant in small parallel time using a small number of processors. Inf. Proc. Lett. 18 (3), 147–150 (1984)

    Article  MATH  Google Scholar 

  2. Bonet M.L., Buss, S.R., Pitassi, T.: Are there hard examples for frege proof systems? In: P. Clote, J. Remmel (eds.), Feasible mathematics II, Birkhauser, Boston, 1995, pp. 30–56

  3. Buss, S.R.: Bounded Arithmetic. Bibliopolis, Naples, 1986

  4. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inf. Com. 64 (13), 2–22 (1985)

    MATH  Google Scholar 

  5. Dummit, D.S., Foote, R.M.: Abstract algebra. Prentice Hall, 1991

  6. Soltys, M.: The complexity of derivations of matrix identities. PhD thesis, University of Toronto, 2001. Available from the ECCC server;see http://www.eccc.uni-trier.de/eccc-local/ECCC-Theses/soltys.html

  7. Soltys, M., Cook, S.A.: The proof complexity of linear algebra. In: Seventeenth Annual IEEE Symposium on Logic in Computer Science (LICS 2002). IEEE Computer Society, 2002

  8. Zambella, D.: Notes on polynomially bounded arithmetic. J. Symbolic Logic 61 (3), 942–966 (1996)

    MATH  Google Scholar 

Download references

Acknowledgments.

The authors would like to thank Steve Cook for the very helpful conversations that led to this work.

Author information

Authors and Affiliations

  1. St Hilda’s College, Cowley Place, Oxford, OX4 1DY, UK

    Neil Thapen

  2. Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, Ontario, L8S 4K1, Canada

    Michael Soltys

Authors
  1. Neil Thapen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Soltys
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neil Thapen.

Additional information

This work was done while a postdoctoral research fellow at the Department of Computer Science, University of Toronto, Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thapen, N., Soltys, M. Weak theories of linear algebra. Arch. Math. Logic 44, 195–208 (2005). https://doi.org/10.1007/s00153-004-0249-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-004-0249-8

Keywords

Search

Navigation