Interpreting Weak König’s Lemma using the Arithmetized Completeness Theorem (Q2814420): Difference between revisions

@@ Property / DOI @@
-.1090/proc/13125
@@ Property / DOI: 10.1090/proc/13125 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2338484241
@@ Property / OpenAlex ID: W2338484241 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124951439
@@ Property / Wikidata QID: Q124951439 / rank @@
+Normal rank
@@ Property / cites work @@
+Formalizing forcing arguments in subsystems of second-order arithmetic
+Normal rank
@@ Property / cites work @@
+Q3140636
@@ Property / cites work: Q3140636 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5286672
@@ Property / cites work: Q5286672 / rank @@
+Normal rank
@@ Property / cites work @@
+Categorical characterizations of the natural numbers require primitive recursion
+Normal rank
@@ Property / cites work @@
+Q3931391
@@ Property / cites work: Q3931391 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215637
@@ Property / cites work: Q4215637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395521
@@ Property / cites work: Q3395521 / rank @@
+Normal rank
@@ Property / cites work @@
+Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
+Normal rank
@@ Property / DOI @@
+.1090/PROC/13125
@@ Property / DOI: 10.1090/PROC/13125 / rank @@
+Normal rank