Scott's problem for proper Scott sets

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial order.

Keywords

Logic, 03H15; 03E35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/146770

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.4364
 http://arxiv.org/abs/0801.4364

Collections

arXiv