Login / Signup

A proof-theoretic study of bi-intuitionistic propositional sequent calculus.

Luís PintoTarmo Uustalu
Published in: J. Log. Comput. (2018)
Keyphrases
  • linear logic
  • cut elimination
  • sequent calculus
  • proof theoretic
  • inference rules
  • wide class
  • high level
  • theorem prover
  • constraint logic programming