Login / Signup

Formalizing Termination Proofs under Polynomial Quasi-interpretations.

Naohi Eguchi
Published in: FICS (2015)
Keyphrases
  • term rewrite systems
  • term rewriting
  • theorem prover
  • theorem proving
  • natural deduction
  • formal proofs
  • computer vision
  • formal proof
  • rewrite systems
  • learning algorithm
  • search engine
  • modal logic
  • low order
  • type checking