37 search results - page 4 / 8 » bsl 2008 |
BSL
1999
13 years 7 months ago
1999
Recently, in a paper by Tarski and Givant (Bull. Symbolic Logic, 1999, 5, 175
BSL
2006
13 years 7 months ago
2006
We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...
BSL
2002
13 years 7 months ago
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
BSL
2008
13 years 7 months ago
2008
We discuss the work of Paul Cohen in set theory and its influence, especially the background, discovery, development of forcing. Paul Joseph Cohen (1934
BSL
2006
13 years 7 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...