Rewriting with linear inferences in propositional logic

DOI10.4230/LIPICS.RTA.2013.158MaRDI QIDQ2958382zbMATH OpenOpenAlexFDO

Authors Anupam Das

Publication date 1 February 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.RTA.2013.158

zbMATH Keywords

proof theorypropositional logiccomplexity of proofsdeep inference

Mathematics Subject Classification ID

Classical propositional logic (03B05) Grammars and rewriting systems (68Q42) Complexity of proofs (03F20)

Recommendations

• On linear rewriting systems for Boolean logic and some applications to proof theory
• No complete linear term rewriting system for propositional logic
• Rewriting, inference, and proof
• scientific article; zbMATH DE number 1231695
• Linear logic and polynomial time

Cited in

(9)

• Enumerating Independent Linear Inferences
• No complete linear term rewriting system for propositional logic
• Rewriting Induction + Linear Arithmetic = Decision Procedure
• On the Power of Substitution in the Calculus of Structures
• On linear rewriting systems for Boolean logic and some applications to proof theory
• A Characterization of Medial as Rewriting Rule
• scientific article; zbMATH DE number 7204450 (Why is no real title available?)
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• Combinatorial flows as bicolored atomic flows

This page was built for publication: Rewriting with linear inferences in propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958382)