Abstract
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
Original language | English |
---|---|
Pages (from-to) | 283-301 |
Number of pages | 19 |
Journal | Journal of Logic and Computation |
Volume | 24 |
Issue number | 1 |
Early online date | 21 Nov 2012 |
DOIs | |
Publication status | Published - Feb 2014 |
Keywords
- classical logic
- propositional logic
- proof theory
- category theory
- matrix method