Computer Science – Logic in Computer Science
Scientific paper
2011-01-07
LMCS 8 (1:25) 2012
Computer Science
Logic in Computer Science
This is a revised journal version of the paper "Formal Theories for Linear Algebra" (Computer Science Logic) for the journal L
Scientific paper
10.2168/LMCS-8(1:25)2012
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.
Cook Stephen A.
Fontes Lila A.
No associations
LandOfFree
Formal Theories for Linear Algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formal Theories for Linear Algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Theories for Linear Algebra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-484217