Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Statman:1979:TCE, author = "R. Statman", title = "The typed $\lambda$-calculus is not elementary recursive", journal = j-THEOR-COMP-SCI, volume = "9", number = "1", pages = "73--81", month = jul, year = "1979", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Philosophy, Univ. of Michigan, Ann Arbor, MI, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "elementary recursive; formal logic; lambda calculus", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }