AML 2007
 |  |
Wall of Fame | Most Viewed AML-2007 Paper
AML
2007
13 years 5 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 95 | ||
| 2 | | 87 | ||
| 3 | | 80 | ||
| 4 | | 77 | ||
| 5 | | 77 | ||
| 6 | | 75 | ||
| 7 | | 68 | ||
| 8 | | 56 | ||
| 9 | | 52 | ||
| 10 | | 51 | ||
| 11 | | 51 | ||
| 12 | | 48 | ||
| 13 | | 42 |