scientific article; zbMATH DE number 3732037
From MaRDI portal
Publication:3919702
Cited in
(7)- Upper bounds for the arithmetical degrees
- Computable linear orders and limitwise monotonic functions
- Low scattered linear orders
- Generically computable linear orderings
- A low scattered linear order of rank 2 without computable copy
- A theorem on strongly \(\eta \)-representable sets
- Degrees of orderings not isomorphic to recursive linear orderings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919702)