Models of arithmetic and upper bounds for arithmetic sets

A. H. Lachlan, Robert Irving Soare · Journal of Symbolic Logic · 1994

Abstract We settle a question in the literature about degrees of models of true arithmetic and upper bounds for the arithmetic sets. We prove that there is a model of true arithmetic whose degree is not a uniform upper bound for the arithmetic sets. The proof involves two forcing constructions.

Read the paper · More papers on PaperTik