Back to Results
First PageMeta Content
Mathematics / Logic / Mathematical logic / Boolean algebra / Formal languages / Semantics / Algebraic logic / Logic in computer science / Substitution / Propositional calculus / Rewriting / Negation


No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional
Add to Reading List

Document Date: 2015-03-23 07:14:32


Open Document

File Size: 434,83 KB

Share Result on Facebook
UPDATE