Weak systems of determinacy and arithmetical quasi-inductive definitions (Q3011112): Difference between revisions

@@ Property / cites work @@
+Eventually infinite time Turing machine degrees: infinite time decidable reals
+Normal rank
@@ Property / cites work @@
+Notes on naive semantics
@@ Property / cites work: Notes on naive semantics / rank @@
+Normal rank
@@ Property / cites work @@
+Parameter-free uniformisation
@@ Property / cites work: Parameter-free uniformisation / rank @@
+Normal rank
@@ Property / cites work @@
+A revenge-immune solution to the semantic paradoxes
+Normal rank
@@ Property / cites work @@
+Q3329455
@@ Property / cites work: Q3329455 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
+Normal rank
@@ Property / cites work @@
+Q4220572
@@ Property / cites work: Q4220572 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040890
@@ Property / cites work: Q4040890 / rank @@
+Normal rank
@@ Property / cites work @@
+An ordinal analysis of stability
@@ Property / cites work: An ordinal analysis of stability / rank @@
+Normal rank
@@ Property / cites work @@
+An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
+Normal rank
@@ Property / cites work @@
+The Length of Infinite Time Turing Machine Computations
+Normal rank