Forcing for hat inductive definitions in arithmetic (Q2922495): Difference between revisions

@@ 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.1002/malq.201300044
+Normal rank
@@ Property / OpenAlex ID @@
+W1959175637
@@ Property / OpenAlex ID: W1959175637 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between <i>ATR</i><sub>0</sub> and
+Normal rank
@@ Property / cites work @@
+Forcing in Proof Theory
@@ Property / cites work: Forcing in Proof Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Does reductive proof theory have a viable rationale?
+Normal rank
@@ Property / cites work @@
+Fixed point theories and dependent choice
@@ Property / cites work: Fixed point theories and dependent choice / rank @@
+Normal rank
@@ Property / cites work @@
+Deduction-preserving "Recursive Isomorphisms" between theories
+Normal rank
@@ Property / cites work @@
+Forcing under Anti‐Foundation Axiom: An expression of the stalks
+Normal rank
@@ Property / cites work @@
+Full and hat inductive definitions are equivalent in NBG
+Normal rank