Rewriting with linear inferences in propositional logic

A. Das

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)

Abstract

Linear inferences are sound implications of propositional logic where each variable appears exactly once in the premiss and conclusion. We consider a specific set of these inferences, MS, first studied by Straßburger, corresponding to the logical rules in deep inference proof theory. Despite previous results characterising the individual rules of MS, we show that there is no polynomialtime characterisation of MS, assuming that integers cannot be factorised in polynomial time. We also examine the length of rewrite paths in an extended system MSU that also has unit equations, utilising a notion dubbed trivialisation to reduce the case with units to the case without, amongst other observations on MS-rewriting and the set of linear inferences in general.
Original languageEnglish
Title of host publication24th International Conference on Rewriting Techniques and Applications (RTA 2013)
EditorsF. van Raamsdonk
Place of PublicationDagstuhl, Germany
PublisherLeibniz International Proceedings in Informatics
Pages158-173
Number of pages16
Volume21
ISBN (Print)9783939897538
DOIs
Publication statusPublished - 14 Jun 2013

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs

Fingerprint Dive into the research topics of 'Rewriting with linear inferences in propositional logic'. Together they form a unique fingerprint.

  • Cite this

    Das, A. (2013). Rewriting with linear inferences in propositional logic. In F. van Raamsdonk (Ed.), 24th International Conference on Rewriting Techniques and Applications (RTA 2013) (Vol. 21, pp. 158-173). (Leibniz International Proceedings in Informatics, LIPIcs). Leibniz International Proceedings in Informatics. https://doi.org/10.4230/LIPIcs.RTA.2013.158