We provide a complete reconstruction of George Boolos' proof of Solovay's Completeness Theorem for arithmetic, and use the mechanics of this proof to reprove 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.
-
Notifications
You must be signed in to change notification settings - Fork 0
jbwheatley/solovayCompleteness
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published