The inductive strength of Ramsey's theorem for pairs (Q507201): Difference between revisions

@@ Property / author @@
-Chi Tat Chong
@@ Property / author: Chi Tat Chong / rank @@
-Normal rank
@@ Property / author @@
+Chi Tat Chong
@@ Property / author: Chi Tat Chong / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aim.2016.11.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2565215485
@@ Property / OpenAlex ID: W2565215485 / rank @@
+Normal rank
@@ Property / cites work @@
+On the strength of Ramsey's theorem for pairs
@@ Property / cites work: On the strength of Ramsey's theorem for pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
+Normal rank
@@ Property / cites work @@
+On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
+Normal rank
@@ Property / cites work @@
+The degree of a \(\Sigma_ n\) cut
@@ Property / cites work: The degree of a \(\Sigma_ n\) cut / rank @@
+Normal rank
@@ Property / cites work @@
+\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
+Normal rank
@@ Property / cites work @@
+The metamathematics of Stable Ramsey’s Theorem for Pairs
+Normal rank
@@ Property / cites work @@
+Ramsey's theorem and recursion theory
@@ Property / cites work: Ramsey's theorem and recursion theory / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
+Normal rank
@@ Property / cites work @@
+Σ_{𝑛}-bounding and Δ_{𝑛}-induction
@@ Property / cites work: Σ_{𝑛}-bounding and Δ_{𝑛}-induction / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:507201