Forcing and models of arithmetic
Author: S. G. Simpson
Journal: Proc. Amer. Math. Soc. 43 (1974), 193-194
MSC: Primary 02H05; Secondary 02H13
MathSciNet review: 0434801
Abstract: It is shown that every countable model of Peano arithmetic with finitely many extra predicates (or of ZFC with finitely many extra predicates) is a reduct of a pointwise definable such model.