Pages that link to "Item:Q4292597"
From MaRDI portal
The following pages link to On the strength of König's duality theorem for countable bipartite graphs (Q4292597):
Displayed 10 items.
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) (Q412061) (← links)
- Computing maximal chains (Q453200) (← links)
- Ordinals and graph decompositions (Q508830) (← links)
- Formalizing forcing arguments in subsystems of second-order arithmetic (Q2563983) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- The model-theoretic ordinal analysis of theories of predicative strength (Q4254639) (← links)
- A Model-Theoretic Approach to Ordinal Analysis (Q4338039) (← links)
- On the relationship between <i>ATR</i><sub>0</sub> and (Q5687314) (← links)