Trees, ordinals and termination (Q5044740): 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.1007/3-540-56610-4_68
+Normal rank
@@ Property / OpenAlex ID @@
+W1867700116
@@ Property / OpenAlex ID: W1867700116 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3695270
@@ Property / cites work: Q3695270 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving termination with multiset orderings
@@ Property / cites work: Proving termination with multiset orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2757839
@@ Property / cites work: Q2757839 / rank @@
+Normal rank
@@ Property / cites work @@
+Orderings for term-rewriting systems
@@ Property / cites work: Orderings for term-rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q5584402
@@ Property / cites work: Q5584402 / rank @@
+Normal rank
@@ Property / cites work @@
+What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
+Normal rank
@@ Property / cites work @@
+Accessible Independence Results for Peano Arithmetic
+Normal rank
@@ Property / cites work @@
+Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
+Normal rank
@@ Property / cites work @@
+Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
+Normal rank