Independence in Arithmetic: The Method of (\mathcal L, n)-Models

MaRDI QIDQ6320276zbMATH OpenFDO

Authors Corey Bacal Switzer

Publication date 10 June 2019

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Applications of model theory (03C98) Ramsey theory (05D10)

Abstract: I develop in depth the machinery of $(mathcalL,n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in $mathsfPA$. I give two applications: 1. Shelah's alternative proof of the Paris-Harrington theorem, and 2. The independence over $mathsfPA$ of a new $P{i}_1^0$ Ramsey theoretic statement about colorings of finite sequences of structures.

This page was built for publication: Independence in Arithmetic: The Method of $(\mathcal L, n)$-Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320276)