Scott's problem for proper Scott sets

Simple item page
dc.creatorGitman, Victoria
dc.date2008-01-28
dc.date.accessioned2026-07-07T08:56:53Z
dc.date.available2026-07-07T08:56:53Z
dc.descriptionI 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.
dc.identifierhttps://arxiv.org/abs/0801.4364
dc.identifierhttp://arxiv.org/abs/0801.4364
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146770
dc.subjectLogic
dc.subject03H15; 03E35
dc.titleScott's problem for proper Scott sets
dc.typetext

Files

Collections

arXiv