Linear logic by levels and bounded time complexity.

Patrick Baillot Damiano Mazza

Published in: Theor. Comput. Sci. (2010)

Keyphrases

linear logic
worst case
computational complexity
fixed point
cut elimination
general purpose
machine learning
reinforcement learning
decision problems
desirable properties
proof theoretic