Search results

...al=[[The Journal of Symbolic Logic]] | volume=2 | number=4 | date=December 1937 | pages=145–152 | title=Logic based on inclusion and abstraction | first=W. [[Category:1816 introductions]] ...

...he [[lambda calculus]]. [[Turing's proof]] was published later, in January 1937. Since then, many other undecidable problems have been described, including ...scheidungsproblem'' goes to press in May 1936 and reaches print in January 1937.<ref>reprinted in {{harvnb|Davis|1965|p=115}}</ref> Turing proves three pro ...

...[[Guinness]] beer. This example was used by [[William Sealy Gosset]] (1876–1937),{{r|Student1907}}{{r|Boland1984}} |year=1937 |volume=8 |issue=2 |pages=103–111 ...

...ly proved such behavior was logically equivalent to Boolean algebra in his 1937 master's thesis, ''[[A Symbolic Analysis of Relay and Switching Circuits]]' [[Category:1847 introductions]] ...

...every sufficiently large odd number is the sum of three primes, though in 1937 Vinogradov gave an unconditional proof. In 1997 [[Jean-Marc Deshouillers|De ...er 2008, Mazur/Stein 2015, Broughan 2017, and Nahin 2021 give mathematical introductions. Titchmarsh 1986, Ivić 1985, and Karatsuba/Voronin 1992 are advanced [[mono ...