Conference
LA, Permutations, and the Hajós Calculus
Abstract
LA is a simple and natural field independent system for reasoning about matrices. We show that LA extended to contain a matrix form of the pigeonhole principle is strong enough to prove a host of matrix identities (so called “hard matrix identities” which are candidates for separating Frege and extended Frege). LAP is LA with matrix powering; we show that LAP extended with quantification over permutations is strong enough to prove theorems such …
Authors
Soltys M
Series
Lecture Notes in Computer Science
Volume
3142
Pagination
pp. 1176-1187
Publisher
Springer Nature
Publication Date
2004
DOI
10.1007/978-3-540-27836-8_97
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743