Pages that link to "Item:Q636310"
From MaRDI portal
The following pages link to On the computational complexity of cut-reduction (Q636310):
Displaying 3 items.
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)
