Pages that link to "Item:Q5300073"
From MaRDI portal
The following pages link to Partial impredicativity in reverse mathematics (Q5300073):
Displaying 7 items.
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Finding paths through narrow and wide trees (Q3616357) (← links)
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? (Q5148106) (← links)
- Comparing DNR and WWKL (Q5311768) (← links)
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077) (← links)
- Searching problems above arithmetical transfinite recursion (Q6584960) (← links)
