Results 1 
5 of
5
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 11 (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
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.
Ultrahomogeneous semilinear spaces
 Proc. London Math. Soc
"... A semilinear space S is a nonempty set of elements called points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Two points p and q are said to be collinear if p 6 ˆ q and if the pair f p; ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A semilinear space S is a nonempty set of elements called points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Two points p and q are said to be collinear if p 6 ˆ q and if the pair f p; qg is contained in a line; the line
The Diagonal Polynomials of Dimension Four
"... We establish the fact that for dimension four there are exactly six diagonal normalized polynomials as has been conjectured for some time. They are determined on the grounds of both theoretical as well as computational results. ..."
Abstract
 Add to MetaCart
We establish the fact that for dimension four there are exactly six diagonal normalized polynomials as has been conjectured for some time. They are determined on the grounds of both theoretical as well as computational results.
A Classification of Finite Homogeneous Semilinear Spaces
"... A semilinear space S is homogeneous if, whenever the semilinear structures induced on two finite subsets S1 and S2 of S are isomorphic, there is at least one automorphism of S mapping S1 onto S2 . We give a complete classification of all finite homogeneous semilinear spaces. Our theorem extends ..."
Abstract
 Add to MetaCart
A semilinear space S is homogeneous if, whenever the semilinear structures induced on two finite subsets S1 and S2 of S are isomorphic, there is at least one automorphism of S mapping S1 onto S2 . We give a complete classification of all finite homogeneous semilinear spaces. Our theorem extends a result of Ronse on graphs and a result of Devillers and Doyen on linear spaces.