What was already known
The background credits Blass–Gurevich–Shelah for the original formalism and Lichter for witnessed choice. The separate PTime/CPT comparison does not assert the same definability witness.
AI involvement
The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.
- Witnessed symmetric choice is strictly stronger than choiceless polynomial time with countingWitnessed symmetric choice is strictly stronger than choiceless polynomial time with counting
- OpenAI mathematics releaseOpenAI mathematics release
Importance
Separates two concrete logics with one witnessed choice and a fixed finite vocabulary.
Technical verification
OpenAI’s comparator scope reports the one-choice expressive separation and distinguishes it from the PTime/CPT result.
Formal checking
OpenAI’s comparator scope reports the one-choice expressive separation and distinguishes it from the PTime/CPT result.
- Checker
- OpenAI’s reported Lean formalization
- Scope
- OpenAI’s comparator scope reports the one-choice expressive separation and distinguishes it from the PTime/CPT result.
- Basis
- Reported by the linked checker
- OpenAI’s Lean scope for this manuscriptOpenAI’s Lean scope for this manuscript
Human understanding
The reviewed sources do not document a human explanation of the assessed contribution.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision