Scott's problem for proper Scott sets
Logic
2008-01-29 v1
Abstract
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.
Cite
@article{arxiv.0801.4364,
title = {Scott's problem for proper Scott sets},
author = {Victoria Gitman},
journal= {arXiv preprint arXiv:0801.4364},
year = {2008}
}