44 research outputs found

    Scott's problem for proper Scott sets

    Full text link
    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
    corecore