The Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages are described in a non-technical way and are illustrated with examples using the TPTP language.

中文翻译：

---

TPTP 世界的逻辑语言

定理证明者的数千个问题 (TPTP) World 是一个完善的基础设施，支持自动定理证明系统的研究、开发和部署。本文概述了 TPTP 世界的逻辑语言，从经典的一阶形式 (FOF)，到类型化的 FOF，再到类型化的高阶形式，再到非经典形式。逻辑语言以非技术性的方式进行描述，并通过使用 TPTP 语言的示例进行说明。