On linear rewriting systems for Boolean logic and some applications to proof theory release_4wfzo4lj3rchlkyezijz7o3ryu

by Anupam Das, Lutz Straßburger

Released as a article .

2016  

Abstract

Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can be written as a (left- and right-)linear rewrite rule. In this paper we study properties of systems consisting only of linear inferences. Our main result is that the length of any 'nontrivial' derivation in such a system is bound by a polynomial. As a consequence there is no polynomial-time decidable sound and complete system of linear inferences, unless coNP=NP. We draw tools and concepts from term rewriting, Boolean function theory and graph theory in order to access some required intermediate results. At the same time we make several connections between these areas that, to our knowledge, have not yet been presented and constitute a rich theoretical framework for reasoning about linear TRSs for Boolean logic.
In text/plain format

Archived Files and Locations

application/pdf  530.7 kB
file_jwgkz2i2jramhlvwolwvxj5amy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-12-23
Version   v3
Language   en ?
arXiv  1610.08772v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: df9c4f9d-fef0-4030-a729-841afcff3edb
API URL: JSON