The following pages link to (Q5477362):
Displaying 4 items.
- Converse consistent enlargements of the unit-level-core of the multi-choice games (Q300870) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- (Q3686470) (← links)