Login / Signup

The Concurrency Complexity for the Horn Fragment of Linear Logic.

Sergey M. Dudakov
Published in: LFCS (1997)
Keyphrases
  • linear logic
  • sequent calculus
  • np hard
  • fixed point
  • desirable properties
  • database systems
  • computational complexity
  • pairwise
  • logical framework
  • proof theoretic