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.
- © Copyright 1974 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 43 (1974), 193-194
- MSC: Primary 02H05; Secondary 02H13
- DOI: https://doi.org/10.1090/S0002-9939-1974-0434801-5
- MathSciNet review: 0434801