Document type
Master thesisPublication date
Publication license
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/170755
Independent Combinatoric Worm Principles for First Order Arithmetic and Beyond
Journal Title
Authors
Director/Tutor
Journal ISSN
Volume Title
Related resource
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.
Description
Treballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelona, Curs: 2019-2020, Tutor: Joost J. Joosten
Subject (English)
Citation
Citation
PAPAFILIPPOU, Konstantinos. Independent Combinatoric Worm Principles for First Order Arithmetic and Beyond. [consulted: 16 of June of 2026]. Available at: https://hdl.handle.net/2445/170755