Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Cited by
  • Crossref logo 31
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Murawski, Roman 1980. Some Remarks on the Structure of Expansions. Mathematical Logic Quarterly, Vol. 26, Issue. 34-35, p. 537.
  • CrossRef
  • Google Scholar
Flum, Jörg and Ziegler, Martin 1980. Topological Model Theory. Vol. 769, Issue. , p. 1.
  • CrossRef
  • Google Scholar
Schlipf, John Stewart 1980. Recursively saturated models of set theory. Proceedings of the American Mathematical Society, Vol. 80, Issue. 1, p. 135.
  • CrossRef
  • Google Scholar
Lachlan, A. H. 1981. Full Satisfaction Classes and Recursive Saturation. Canadian Mathematical Bulletin, Vol. 24, Issue. 3, p. 295.
  • CrossRef
  • Google Scholar
Ratajczyk, Z. 1982. Satisfaction Classes and Combinatorial Sentences Independent From PA. Mathematical Logic Quarterly, Vol. 28, Issue. 8-12, p. 149.
  • CrossRef
  • Google Scholar
Feferman, Solomon 1982. Logic Colloquium '80 - Papers intended for the European Summer Meeting of the Association for Symbolic Logic. Vol. 108, Issue. , p. 95.
  • CrossRef
  • Google Scholar
Macintyre, Angus 1982. Logic, Methodology and Philosophy of Science VI, Proceedings of the Sixth International Congress of Logic, Methodology and Philosophy of Science. Vol. 104, Issue. , p. 193.
  • CrossRef
  • Google Scholar
Seremet, Zofia 1984. ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC. Mathematical Logic Quarterly, Vol. 30, Issue. 19-24, p. 349.
  • CrossRef
  • Google Scholar
Murawski, Roman 1988. Definable sets and expansions of models of Peano arithmetic. Archive for Mathematical Logic, Vol. 27, Issue. 1, p. 21.
  • CrossRef
  • Google Scholar
Murawski, Roman 1990. A note on the variety of satisfaction classes. Archive for Mathematical Logic, Vol. 30, Issue. 2, p. 83.
  • CrossRef
  • Google Scholar
Enayat, Ali 1990. Minimal elementary extensions of models of set theory and arithmetic. Archive for Mathematical Logic, Vol. 30, Issue. 3, p. 181.
  • CrossRef
  • Google Scholar
1990. Model Theory. Vol. 73, Issue. , p. 634.
  • CrossRef
  • Google Scholar
Murawski, Roman 1991. Some Properties of the Family of Expansions to Models of A/Δ + Σ‐AC. Mathematical Logic Quarterly, Vol. 37, Issue. 17, p. 265.
  • CrossRef
  • Google Scholar
Mancosu, Paolo 1991. Generalizing classical and effective model theory in theories of operations and classes. Annals of Pure and Applied Logic, Vol. 52, Issue. 3, p. 249.
  • CrossRef
  • Google Scholar
Kaye, Richard Kossak, Roman and Kotlarski, Henryk 1991. Automorphisms of recursively saturated models of arithmetic. Annals of Pure and Applied Logic, Vol. 55, Issue. 1, p. 67.
  • CrossRef
  • Google Scholar
Murawski, Roman 1992. ITERATIONS OF SATISFACTION CLASSES AND MODELS OF PEANO ARITHMETIC. Mathematical Logic Quarterly, Vol. 38, Issue. 1, p. 59.
  • CrossRef
  • Google Scholar
Kotlarski, Henryk 1995. Automorphisms of Countable Recursively Saturated Models of PA: A Survey. Notre Dame Journal of Formal Logic, Vol. 36, Issue. 4,
  • CrossRef
  • Google Scholar
Kalantari, I. 1998. Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory. Vol. 138, Issue. , p. 515.
  • CrossRef
  • Google Scholar
Harizanov, Valentina S. 1998. Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory. Vol. 138, Issue. , p. 3.
  • CrossRef
  • Google Scholar
Millar, Terrence S. 1999. Handbook of Computability Theory. Vol. 140, Issue. , p. 507.
  • CrossRef
  • Google Scholar
Download full list
Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Our Platforms

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Higher Education

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Toward model theory through recursive saturation1
  • Volume 43, Issue 2
  • John Stewart Schlipf (a1)
  • DOI: https://doi.org/10.2307/2272817
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Toward model theory through recursive saturation1
  • Volume 43, Issue 2
  • John Stewart Schlipf (a1)
  • DOI: https://doi.org/10.2307/2272817
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Toward model theory through recursive saturation1
  • Volume 43, Issue 2
  • John Stewart Schlipf (a1)
  • DOI: https://doi.org/10.2307/2272817
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.
You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.