

Publisher: Cambridge University Press
E-ISSN: 1943-5886|66|1|325-348
ISSN: 0022-4812
Source: The Journal of Symbolic Logic, Vol.66, Iss.1, 2001-03, pp. : 325-348
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In the early eighties, answering a question of A. Macintyre, J. H. Schmerl ([13]) proved that every countable recursively saturated structure, equipped with a function
Related content


Colloque franco-exsovietique de théorie des modèles
The Journal of Symbolic Logic, Vol. 58, Iss. 4, 1993-12 ,pp. :


L'arithmétique ouverte et ses modèles non-standards
The Journal of Symbolic Logic, Vol. 56, Iss. 2, 1991-06 ,pp. :






ESAIM: Proceedings, Vol. 9, Iss. issue, 2000-01 ,pp. :