An undecidable linear order that is \(n\)-decidable for all \(n\) (Q5937834): 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.1305/ndjfl/1039118866
+Normal rank
@@ Property / OpenAlex ID @@
+W2159037930
@@ Property / OpenAlex ID: W2159037930 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249724
@@ Property / cites work: Q4249724 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of games to the completeness problem for formalized theories
+Normal rank
@@ Property / cites work @@
+Q3230355
@@ Property / cites work: Q3230355 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764115
@@ Property / cites work: Q4764115 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+Q3949052
@@ Property / cites work: Q3949052 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5937834