No abstract

No abstract

Both in Kripke's Theory of Truth KTT [7] and Russell's Ramified Type Theory RTT [15, 8] we are confronted with some hierarchy. In RTT, we have a double hierarchy of orders and types. That is, the class of propositions is divided into different orders where a propositional function can only depend on objects of lower orders and types. Kripke on the other hand, has a ladder of languages where the truth of a proposition in language Ln can only be made in Lm where m > n. Kripke finds a fixed point for his hierarchy (something Russell does not attempt to do). We investigate in this paper the similarities of both hierarchies: At level n of KTT the truth or falsehood of all order-n-propositions of RTT can be established. Moreover, there are order-n-propositions that get a truth value at an earlier stage in KTT

In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910–1912) and Church's simply typed λ-calculus of 1940. We first argue that the concept of types has always been present in mathematics, though nobody was incorporating them explicitly as such, before the end of the 19th century. Then we proceed by describing how the logical paradoxes entered the formal systems of Frege, Cantor and Peano concentrating on Frege's Grundgesetze der Arithmetik for which Russell applied his famous paradox and this led him to introduce the first theory of types, the Ramified Type Theory (RTT). We present RTT formally using the modern notation for type theory and we discuss how Ramsey, Hilbert and Ackermann removed the orders from RTT leading to the simple theory of types STT. We present STT and Church's own simply typed λ-calculus (λ→C) and we finish by comparing RTT, STT and λ→C.

No abstract