Results 1  10
of
20
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 10 (5 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
Motivations for MathLang
, 2005
"... FOMCAF13 What do we want? Open borders for productive collaboration or that we each stick to our borders without including and benefiting from other input? Do we want war+destruction or solid foundations for wisdom and prosperity? • Do we believe in the chosen framework? Should all the world believe ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
FOMCAF13 What do we want? Open borders for productive collaboration or that we each stick to our borders without including and benefiting from other input? Do we want war+destruction or solid foundations for wisdom and prosperity? • Do we believe in the chosen framework? Should all the world believe in the same framework? Does one framework fit all? Can such a framework exist? • Think of Capitalism, Communism, dictatorship, nationalism, etc... Which one worked in history? • But then, if we are committed to pluralism, are we in danger of being wiped out because being inclusive may well lead to contradictions? • Oscar Wilde: I used to think I was indecisive, but now I’m not sure anymore. FOMCAF13 1Things are not as somber: There is no perfect framework, but some can be invaluable • De Bruijn used to proudly announce: I did it my way. • I quote Dirk van Dalen: The Germans have their 3 B’s, but we Dutch too have our 3 B’s: Beth, Brouwer and de Bruijn. FOMCAF13 2There is a fourth B:
A Correspondence between MartinLöf Type Theory, the Ramified Theory of Types and Pure Type Systems
 Journal of Logic, Language and Information
, 2001
"... In Russell's Ramified Theory of Types rtt, two hierarchical concepts dominate: orders and types. The use of orders has as a consequence that the logic part of rtt is predicative. The concept of order however, is almost dead since Ramsey eliminated it from rtt. This is why we find Church's ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In Russell's Ramified Theory of Types rtt, two hierarchical concepts dominate: orders and types. The use of orders has as a consequence that the logic part of rtt is predicative. The concept of order however, is almost dead since Ramsey eliminated it from rtt. This is why we find Church's simple theory of types (which uses the type concept without the order one) at the bottom of the Barendregt Cube rather than rtt. Despite the disappearance of orders which have a strong correlation with predicativity, predicative logic still plays an influential role in Computer Science. An important example is the proof checker Nuprl, which is based on MartinLöf's Type Theory which uses type universes. Those type universes, and also degrees of expressions in Automath, are closely related to orders. In this paper, we show that orders have not disappeared from modern logic and computer science, rather, orders play a crucial role in understanding the hierarchy of modern systems. In order to achieve our goal, we concentrate on a subsystem of Nuprl. The novelty of our paper lies in: 1) a modest revival of Russell's orders, 1 2) the placing of the historical system rtt underlying the famous Principia Mathematica in a context with a modern system of computer mathematics (Nuprl) and modern type theories (MartinLöf's type theory and PTSs), and 3) the presentation of a complex type system (Nuprl) as a simple and compact PTS.
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 &am ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In &quot;Principia Mathematica &quot; [17], B. Russell and A.N. Whitehead propose a type system for higher order logic. This system has become known under the name &quot;ramified type theory&quot;. It was invented to avoid the paradoxes, which could be conducted from Frege's &quot;Begriffschrift&quot; [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 &quot;truth&quot;, 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
A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths
 Journal of the Interest Group in Pure and Applied Logic 4(2
, 1996
"... Both in Kripke's Theory of Truth ktt [8] and Russell's Ramified Type Theory rtt [16, 9] 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 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Both in Kripke's Theory of Truth ktt [8] and Russell's Ramified Type Theory rtt [16, 9] 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 ordernpropositions of rtt can be established. Moreover, there are ordernpropositions that get a truth value at an earlier stage in ktt. Furthermore, we show that rtt is more restrictive than ktt, as some type restrictions are not needed in ktt and more formulas can be expressed in the latter. Looking back at the dou...
Logic and Computerisation in mathematics?
, 2009
"... – If you give me an algorithm to solve Π, I can check whether this algorithm really solves Π. – But, if you ask me to find an algorithm to solve Π, I may go on forever trying but without success. • But, this result was already found by Aristotle: Assume a proposition Φ. – If you give me a proof of Φ ..."
Abstract
 Add to MetaCart
– If you give me an algorithm to solve Π, I can check whether this algorithm really solves Π. – But, if you ask me to find an algorithm to solve Π, I may go on forever trying but without success. • But, this result was already found by Aristotle: Assume a proposition Φ. – If you give me a proof of Φ, I can check whether this proof really proves Φ. – But, if you ask me to find a proof of Φ, I may go on forever trying but without success. • In fact, programs are proofs and much of computer science in the early part of the 20th century was built by mathematicians and logicians. • There were also important inventions in computer science made by physicists (e.g., von Neumann) and others, but we ignore these in this talk. ISR 2009, Brasiliá, Brasil 1An example of a computable function/solvable problem • E.g., 1.5 chicken lay down 1.5 eggs in 1.5 days. • How many eggs does 1 chicken lay in 1 day? • 1.5 chicken lay 1.5 eggs in 1.5 days. • Hence, 1 chicken lay 1 egg in 1.5 days. • Hence, 1 chicken lay 2/3 egg in 1 day. ISR 2009, Brasiliá, Brasil 2Unsolvability of the Barber problem • which man barber in the village shaves all and only those men who do not shave themselves? • If John was the barber then – John shaves Bill ⇐ ⇒ Bill does not shave Bill – John shaves x ⇐ ⇒ x does not shave x – John shaves John ⇐ ⇒ John does not shave John • Contradiction. ISR 2009, Brasiliá, Brasil 3Unsolvability of the Russell set problem
Functions and Types in Logic, Language and Computation
, 2003
"... The introduction of a general definition of function was key to Frege’s formalisation of logic. Selfapplication of functions was at the heart of Russell’s paradox. Russell introduced type theory in order to control the application of functions and hence to avoid the paradox. Since, different type s ..."
Abstract
 Add to MetaCart
The introduction of a general definition of function was key to Frege’s formalisation of logic. Selfapplication of functions was at the heart of Russell’s paradox. Russell introduced type theory in order to control the application of functions and hence to avoid the paradox. Since, different type systems have been introduced, each allowing different functional power. Despite the extensive use of types in many applications, there remains many “non believers ” in type theory. In this talk, I will briefly review the evolution of types from the time of Euclid (325 B.C.) to the mid of the 20th century. Then, I will introduce de Bruijn’s formulation of functions and types in Automath, his famous system for automating mathematics. De Bruijn’s formulation is a living example which illustrates that while type theory is useful, there are many other considerations that need to be accommodated when attempting to “computerize” a system. This talk is of interest for anyone
Generalisation of Functions and the Birth of Types and Computation A Talk dedicated to Professor Tetsuo Ida
, 2012
"... Tetsuo Ida SymposiumProf Ida will always be at the top of the tree supporting and influencing us ..."
Abstract
 Add to MetaCart
Tetsuo Ida SymposiumProf Ida will always be at the top of the tree supporting and influencing us
From the Foundation of Mathematics to the Birth of Computation
, 2011
"... deduction/Logic was taken as a foundation for Mathematics, computation was also taken throughout as an essential tool in mathematics. • Our ancestors used sandy beaches to compute the circomference of a circle, and to work out approximations/values of numbers like π. • The word algorithm dates back ..."
Abstract
 Add to MetaCart
deduction/Logic was taken as a foundation for Mathematics, computation was also taken throughout as an essential tool in mathematics. • Our ancestors used sandy beaches to compute the circomference of a circle, and to work out approximations/values of numbers like π. • The word algorithm dates back centuries? Algorithms existed in anciant Egypt at the time of Hypatia. The word is named after AlKhawarizmi. • But even more impressively, the following important 20th century (un)computability result was known to Aristotle. • Assume a problem Π, – If you give me an algorithm to solve Π, I can check whether this algorithm really solves Π. – But, if you ask me to find an algorithm to solve Π, I may go on forever trying but without success. HAPOC11: History and Philosophy of Computing 1 • But, this result was already known to Aristotle: • Assume a proposition Φ. – If you give me a proof of Φ, I can check whether this proof really proves Φ. – But, if you ask me to find a proof of Φ, I may go on forever trying but without success. • In fact, programs are proofs: – program = algorithm = computable function = λterm. – By the PAT principle: Proofs are λterms.
MathLang: A language for Mathematics
, 2004
"... Parts of this talk are based on joint work with Nederpelt [4] and Maarek and Wells [5] ..."
Abstract
 Add to MetaCart
Parts of this talk are based on joint work with Nederpelt [4] and Maarek and Wells [5]