The Dependently Typed Higher-Order Form for the TPTP World
By: Daniel Ranalter , Cezary Kaliszyk , Florian Rabe and more
Potential Business Impact:
Lets computers understand more complex math problems.
Much of the current research and development in the field of automated reasoning builds on the infrastructure provided by the TPTP World. The TPTP language for logical formulae is central to the far-reaching adoption of the TPTP World. This paper introduces the Dependently Typed higher-order Form (DTF) of the TPTP language. It takes advantage of already established binders in the syntax, and is thus a minimally intrusive extension to the Typed Higher-order Form (THF). A starting set of over 100 problems is provided to exhibit the usefulness and incite interest in DTF. Some tools that are already able to reason about problems in the DTF language are discussed.
Similar Papers
TPTP World Infrastructure for Non-classical Logics
Logic in Computer Science
Helps computers prove math problems in new ways.
SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus
Logic in Computer Science
Lets computers share and check math proofs.
Subtyping in DHOL -- Extended preprint
Logic in Computer Science
Lets computers prove harder math problems.