Search results

...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.

...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 particula