Pages that link to "Item:Q2882563"
From MaRDI portal
The following pages link to Exploring the computational content of the infinite pigeonhole principle (Q2882563):
Displaying 9 items.
- From heaps of matches to the limits of computability (Q396877) (← links)
- Proofs, programs, processes (Q693063) (← links)
- On the form of witness terms (Q982183) (← links)
- The computational content of arithmetical proofs (Q1762353) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Finitely repeated search and the diamond paradox (Q2043130) (← links)
- (Q5028422) (← links)
- On Tao's “finitary” infinite pigeonhole principle (Q5190206) (← links)
- Expansion trees with cut (Q5236547) (← links)