Results 1 
7 of
7
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
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 simple the ..."
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.
Reviewing the classical and the de Bruijn notation for λcalculus and pure type systems
 Logic and Computation
, 2001
"... This article is a brief review of the type free λcalculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type free λcalculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This article is a brief review of the type free λcalculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type free λcalculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentation of the λcalculus with de Bruijn indices, we illustrate how a calculus of explicit substitutions can be obtained. In addition, de Bruijn's notation for the λcalculus is introduced and some of its advantages are outlined.
What is Frege’s Theory of Descriptions?
"... When prompted to consider Frege’s views about definite descriptions, many philosophers think about the meaning of proper names, and some of them can cite the following quotation taken from a footnote Frege’s 1892 article “ Über Sinn und Bedeutung.”2 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
When prompted to consider Frege’s views about definite descriptions, many philosophers think about the meaning of proper names, and some of them can cite the following quotation taken from a footnote Frege’s 1892 article “ Über Sinn und Bedeutung.”2
Identity, Indiscernibility, and Philosophical Claims
, 2002
"... The standard ways classical logic and mathematics deal with the concept of indiscernibility (indistinguishability), with special emphasis to the concept of indiscernibility in a structure are considered. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The standard ways classical logic and mathematics deal with the concept of indiscernibility (indistinguishability), with special emphasis to the concept of indiscernibility in a structure are considered.
Sémantique Dénotationnelle
, 1996
"... ui n'est plus ambigu + @ @ @ @ @ @ @ a + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ ~ b c ## + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ + @ @ @ @ @ @ @ @ c a b Probleme: definir la syntaxe de facon que toutes les ambigu tes syntaxiques soient resolubles simplement par l'analyse syntaxi ..."
Abstract
 Add to MetaCart
ui n'est plus ambigu + @ @ @ @ @ @ @ a + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ ~ b c ## + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ + @ @ @ @ @ @ @ @ c a b Probleme: definir la syntaxe de facon que toutes les ambigu tes syntaxiques soient resolubles simplement par l'analyse syntaxique. Ce n'est pas les cas des vecteurs et fonctions FORTRAN, comme on verra plus avant. Semantique denotationnelle DEA'96 Roberto Di Cosmo 4 Semantique . semantique: Une fois bien defini quels sont les programmes syntaxiquement correctes, on doit pouvoir dire de facon precise et univoque ce que chaque programme "fait" a l'execution (ce qu'il calcule, ou comment il se conduit), y compris si l'execution donne lieu a des erreurs: cela est indispensable pour  l'utilisateur  l'implementateur
DEA Programmation 1996 Semantique denotationnelle
"... n'est plus ambigu + @ @ @ @ @ @ @ a + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ ~ b c ## + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ + @ @ @ @ @ @ @ @ c a b Probleme: definir la syntaxe de facon que toutes les ambigu tes ..."
Abstract
 Add to MetaCart
n'est plus ambigu + @ @ @ @ @ @ @ a + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ ~ b c ## + > > > > > > > > ~ ~ ~ ~ ~ ~ ~ + @ @ @ @ @ @ @ @ c a b Probleme: definir la syntaxe de facon que toutes les ambigu tes syntaxiques soient resolubles simplement par l'analyse syntaxique. Ce n'est pas les cas des vecteurs et fonctions FORTRAN, comme on verra plus avant. Semantique denotationnelle DEA'96 Roberto Di Cosmo 4 Semantique . semantique: Une fois bien defini quels sont les programmes syntaxiquement correctes, on doit pouvoir dire de facon precise et univoque ce que chaque programme "fait" a l'execution (ce qu'il calcule, ou comment il se conduit), y compris si l'execution donne lieu a des erreurs: cela est indispensable pour  l'utilisateu