24 search results - page 2 / 5 » lics 1999 |
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andr
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...