Scott's problem for proper Scott sets
classification
🧮 math.LO
keywords
properscottalgebraarithmeticallyassumingbooleanclosedevery
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.