Question
This thinker’s alternative definition of quantifiers using the term-forming epsilon operator has been applied to anaphora in natural language. Natural deduction contrasts with proof systems named for this thinker, which often use modus ponens as the only rule of inference. W. W. Tait argued that this thinker’s Kant-influenced “finitary arithmetic” corresponds to primitively recursive arithmetic. This thinker’s formalist project began in his Grundlagen der Geometrie. He’s not Ackermann, but the (*) Church-Turing thesis contradicts this thinker’s hope that an algorithm could decide the truth of any statement, called the Entscheidungsproblem. Gödel’s incompleteness theorem proved the infeasibility of this thinker’s namesake program, which attempted to axiomatize all of mathematics. For 10 points, what German mathematician theorized a paradox involving an infinitely large hotel? ■END■
Buzzes
Summary
| Tournament | Edition | Exact Match? | TUH | Conv. % | Power % | Neg % | Average Buzz |
|---|---|---|---|---|---|---|---|
| 2025 RMP Fest Online Mirror | 05/31/25 | Y | 5 | 100% | 0% | 20% | 97.40 |
| 2025 RMP Fest Carleton Mirror | 07/13/25 | Y | 3 | 100% | 33% | 33% | 80.00 |
| 2025 RMP Fest CO Mirror | 08/10/25 | Y | 6 | 100% | 17% | 17% | 82.83 |