Computability on linear orderings enriched with predicates (Q431704): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10469-009-9067-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2088657950
@@ Property / OpenAlex ID: W2088657950 / rank @@
+Normal rank
@@ Property / cites work @@
+Every Low Boolean Algebra is Isomorphic to a Recursive One
+Normal rank
@@ Property / cites work @@
+Every Low 2 Boolean Algebra has a Recursive Copy
@@ Property / cites work: Every Low 2 Boolean Algebra has a Recursive Copy / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Boolean algebras
@@ Property / cites work: Computable Boolean algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Δ 2 0 -copies of linear orderings
@@ Property / cites work: Δ 2 0 -copies of linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies of Boolean algebras
@@ Property / cites work: Hierarchies of Boolean algebras / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
+Normal rank
@@ Property / cites work @@
+Jumps of Orderings
@@ Property / cites work: Jumps of Orderings / rank @@
+Normal rank
@@ Property / cites work @@
+A construction for recursive linear orderings
@@ Property / cites work: A construction for recursive linear orderings / rank @@
+Normal rank