English

Formal Theories for Linear Algebra

Logic in Computer Science 2015-07-01 v4

Abstract

We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory LAp over arbitrary integral domains, into each of our new theories. The result shows equivalences of standard theorems of linear algebra over Z2 and Z can be proved in the corresponding theory, but leaves open the interesting question of whether the theorems themselves can be proved.

Keywords

Cite

@article{arxiv.1101.1449,
  title  = {Formal Theories for Linear Algebra},
  author = {Stephen A Cook and Lila A Fontes},
  journal= {arXiv preprint arXiv:1101.1449},
  year   = {2015}
}

Comments

This is a revised journal version of the paper "Formal Theories for Linear Algebra" (Computer Science Logic) for the journal Logical Methods in Computer Science

R2 v1 2026-06-21T17:08:54.500Z