THF0

swMATH3310MaRDI QIDQ15842FDOQ15842

Author name not available (Why is that?)

Described by source

• THF0 – The Core of the TPTP Language for Higher-Order Logic

Cited In (13)

• 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
• Title not available (Why is that?)
• 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
• GRUNGE: a grand unified ATP challenge
• Combining logics in simple type theory
• The TPTP World -- infrastructure for automated reasoning
• Title not available (Why is that?)
• Functions-as-constructors Higher-order Unification

This page was built for software: THF0