Witnessed symmetric choice is strictly stronger than choiceless polynomial time with counting

Get email updates

OpenAI

A fixed sentence with one witnessed symmetric choice operator defines a Boolean query on all finite structures over a fixed eight-relation vocabulary that no choiceless polynomial time with counting sentence defines.

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 AI-led

The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.

Importance Notable

Separates two concrete logics with one witnessed choice and a fixed finite vocabulary.

Technical verification Formal (Lean)

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

Human understanding Few

The reviewed sources do not document a human explanation of the assessed contribution.

Correction and publication history