Search results
From LLWiki
- ...e units <math>\top</math> (''top'') and <math>\zero</math> (''zero''); the computational content of these connectives, which behave more closely to their intuitioni ...in linear logic). One may expect that smaller fragments have lower logical complexity.22 KB (3,435 words) - 21:17, 28 October 2013
- ...e designed by defining alternative exponential connectives, which induce a complexity bound on the cut-elimination procedure.<br> ...'implicit computational complexity'', the area studying the computational complexity of programs without referring to external measuring conditions or particula6 KB (994 words) - 09:28, 2 May 2013