We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...