LCC
1994
14 years 3 months ago
1994
LCC
1994
14 years 3 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
LCC
1994
14 years 3 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
LCC
1994
14 years 3 months ago
1994
49
Voted
LCC
1994
14 years 3 months ago
1994
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
LCC
1994
14 years 3 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...