Skip Navigation



Logic Journal of IGPL Advance Access published online on October 17, 2007
Logic Journal of IGPL, doi:10.1093/jigpal/jzm043
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
15/5-6/637    most recent
jzm043v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Junqueira, L. R.
Right arrow Articles by Passos, M. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

On extensions of elementary submodels by forcing*

Lúcia R. Junqueira

Universidade de São Paulo, São Paulo, Brazil. E-mail: lucia{at}ime.usp.br

Paul Larson

Miami University, Oxford, Ohio, USA. E-mail: larsonpb{at}muohio.edu

Marcelo D. Passos

Universidade de São Paulo, São Paulo, Brazil. E-mail: md_passos{at}yahoo.com


  Abstract

We study when a partial order Formula preserves certain properties of an elementary submodel (of a structure of the form H{theta}), including countable closure and {omega}-covering. In particular, we discuss the existence of {omega}-covering elementary submodels of different sizes.

Key Words: forcing • elementary submodels • {omega}-covering

*Dedicated to the memory of Prof. Edison Farah


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.