2000 character limit reached
The Barwise-Schlipf Theorem
Published 12 Nov 2019 in math.LO | (1911.05117v2)
Abstract: In 1975 Barwise and Schlipf published a landmark paper whose main theorem asserts that a nonstandard model $\mathcal{M}$ of PA (Peano arithmetic) is recursively saturated iff $\mathcal{M}$ has an expansion that satisfies the subsystem $\Delta_11$-${\sf CA}_0$ of second order arithmetic. In this paper we identify a crucial error in the Barwise-Schlipf proof of the right-to-left direction of the theorem, and additionally, we offer a correct proof of the problematic direction.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.