Independent Combinatoric Worm Principles for First Order Arithmetic and Beyond

Abstract

In this thesis we study Beklemishev’s combinatorial principle Every Worm Dies, EWD which although true, it is unprovable in Peano Arithmetic (PA). The principle talks about sequences of modal formulas, the finiteness of all of them being equivalent to the one-consistency of PA. We present the elements of proof theory at play here and perform two attempts at generalizing this theorem. One is directed towards its relationship with some known fragments of PA while the other aims to see its connection with fragments of second order arithmetic.