Pages that link to "Item:Q636310"
From MaRDI portal
The following pages link to On the computational complexity of cut-reduction (Q636310):
Displaying 13 items.
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- Computing circumscription revisited: A reduction algorithm (Q1367072) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- (Q3113727) (← links)
- 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)
- (Q4601841) (← links)
- Computer Science Logic (Q5292638) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)