Cited in
(22)- Verifying the modal logic cube is an easy task (for higher-order automated reasoners)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Formal logic definitions for interchange languages
- scientific article; zbMATH DE number 5850137 (Why is no real title available?)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic
- Proofs and reconstructions
- Combining and automating classical and non-classical logics in classical higher-order logics
- The TPTP typed first-order form with arithmetic
- LEO-II
- TPS
- I-SATCHMO
- ForTheL
- SystemOnTPTP
- AgsyHOL
- SigmaKEE
- SNARK
- GoedelGod
- GRUNGE: a grand unified ATP challenge
- Combining logics in simple type theory
- The TPTP World -- infrastructure for automated reasoning
- scientific article; zbMATH DE number 7178360 (Why is no real title available?)
- Functions-as-constructors Higher-order Unification
This page was built for software: THF0
