A very fast development in the early 1930’s following Hilbert’s codification of Mathematical Logic led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of Recursive Function Theory. The so-called Lambda Calculus played a key role. The history of these developments were traced, and the much later place of Lambda Calculus in Mathematics and Programming-Language Theory were outlined. (See also theACM A.M. Turing Centenary Celebration)
Scholardarity is a website for research and publication in the humanities. We aim to be a community of scholars who share their ideas, discuss their research, and provide each other with support. By e-publishing your articles, manuscripts, and books on Scholardarity, you can gain recognition for your scholarship and push the frontiers of knowledge for our readers. As a subscriber, you will benefit from peer review, criticism, and editing. And as a contributor, you will provide your readers with a wealth of high quality information, much of which is free. We invite you to join Scholardarity, and put your writing to work for you!