You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
We provide a complete reconstruction of George Boolos' proof of Solovay's Completeness Theorem for arithmetic, and use the mechanics of this prove to reproof a result due to de Jongh, Jumelet and Montagna, concerning an upper bound on the minimal set of properties an arithmetic system must have in order to satisfy Solovay's Theorem.
