Infinite versions of some problems from finite complexity theory (Q1374209): Difference between revisions

@@ Property / cites work @@
+On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Countable algebra and set existence axioms
@@ Property / cites work: Countable algebra and set existence axioms / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in infinite graphs
@@ Property / cites work: Hamiltonian paths in infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Taking it to the limit: On infinite variants of NP-complete problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs, dynamic programming, and finite games
@@ Property / cites work: Graphs, dynamic programming, and finite games / rank @@
+Normal rank
@@ Property / cites work @@
+Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
+Normal rank
@@ Property / cites work @@
+Proof theory. 2nd ed
@@ Property / cites work: Proof theory. 2nd ed / rank @@
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank