Pages that link to "Item:Q2976345"
From MaRDI portal
The following pages link to THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345):
Displaying 12 items.
- Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← links)
- A combinatorial result related to the consistency of New Foundations (Q638501) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Combinatorial versus decision-theoretic components of impossibility theorems (Q1915820) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- Strong combinatorial principles and level by level equivalence (Q2701204) (← links)
- A combinatorial version of the Svenonius theorem on definability (Q4644608) (← links)
- Definable combinatorics at the first uncountable cardinal (Q4963636) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Erdős-Moser and \(I \Sigma_2\) (Q6635147) (← links)