Model-theoretic properties characterizing Peano arithmetic
Model-theoretic properties characterizing Peano arithmetic
复制标题
表征皮亚诺算术的模型理论特性
DOI:
10.2307/2275063
复制
发表时间:
1991
影响因子:
0.6
通讯作者:
R. Kaye
中科院分区:
文献类型:
--
作者:
R. Kaye
Abstract Let = {0,1, +,·,<} be the usual first-order language of arithmetic. We show that Peano arithmetic is the least first-order -theory containing IΔ0 + exp such that every complete extension T of it has a countable model K satisfying (i) K has no proper elementary substructures, and (ii) whenever L ≻ K is a countable elementary extension there is and such that . Other model-theoretic conditions similar to (i) and (ii) are also discussed and shown to characterize Peano arithmetic.