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, (15[1])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 (10[1])proved the infeasibility of this thinker’s namesake (-5[1])program, which attempted to axiomatize all of mathematics. For 10 points, what German mathematician theorized a paradox involving an infinitely large hotel? ■END■ (10[1])

Back to tossups

Buzzes

Summary