Publisher： Cambridge University Press
E-ISSN： 1943-5886|51|2|421-429
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.51, Iss.2, 1986-06, pp. : 421-429
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Recursively saturated nonstandard models of arithmetic
The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. :
Access to resources
Recommend
Recursively saturated nonstandard models of arithmetic; addendum
The Journal of Symbolic Logic, Vol. 47, Iss. 3, 1982-09 ,pp. :
An introduction to recursively saturated and resplendent models
The Journal of Symbolic Logic, Vol. 41, Iss. 2, 1976-06 ,pp. :
Saturated models of Peano arithmetic
The Journal of Symbolic Logic, Vol. 47, Iss. 3, 1982-09 ,pp. :
On recursively enumerable and arithmetic models of set theory
The Journal of Symbolic Logic, Vol. 23, Iss. 4, 1958-12 ,pp. :