Results 1 -
2 of
2
Types in logic and mathematics before 1940
- Bulletin of Symbolic Logic
, 2002
"... Abstract. 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, thou ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Abstract. 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 1 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 2) and we finish by comparing rtt, stt and λ→C. §1. Introduction. Nowadays, type theory has many applications and is used in many different disciplines. Even within logic and mathematics, there are many different type systems. They serve several purposes, and are formulated in various ways. But, before 1903 when Russell first introduced
A formalization of the Ramified Type Theory
, 1994
"... In "Principia Mathematica " [17], B. Russell and A.N. Whitehead propose a type system for higher order logic. This system has become known under the name "ramified type theory". It was invented to avoid the paradoxes, which could be conducted from Frege's "Begriffschrift&quo ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
In "Principia Mathematica " [17], B. Russell and A.N. Whitehead propose a type system for higher order logic. This system has become known under the name "ramified type theory". It was invented to avoid the paradoxes, which could be conducted from Frege's "Begriffschrift" [7]. We give a formalization of the ramified type theory as described in the Principia Mathematica, trying to keep it as close as possible to the ideas of the Principia. As an alternative, distancing ourselves from the Principia, we express notions from the ramified type theory in a lambda calculus style, thus clarifying the type system of Russell and Whitehead in a contemporary setting. Both formalizations are inspired by current developments in research on type theory and typed lambda calculus; see e.g. [3]. In these formalizations, and also when defining "truth", we will need the notion of substitution. As substitution is not formally defined in the Principia, we have to define it ourselves. Finally, the reaction by Hilbert and Ackermann in [10] on the

