RTA   2015 International Conference on Rewriting Techniques and Applications
Wall of Fame | Most Viewed RTA-2015 Paper
7 years 10 months ago
No complete linear term rewriting system for propositional logic
Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every boolean tautology can be written as...
Anupam Das, Lutz Straßburger
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source40
2Download preprint from source31
3Download preprint from source25
4Download preprint from source25
5Download preprint from source23
6Download preprint from source23
7Download preprint from source22
8Download preprint from source20
9Download preprint from source18
10Download preprint from source15
11Download preprint from source13
12Download preprint from source11