Order-computable sets
From MaRDI portal
Recommendations
- On initial segments of computable linear orders
- Weak presentations of computable partial orderings
- Relative complexity for computable presentations of the conventional linear order on the set of naturals
- The Settling Time Reducibility Ordering and Formula Sets
- Degree spectra of unary relations on \langle \omega, \leq \rangle
Cited in
(21)- Weak presentations of computable ordered semigroups
- Effectively categorical abelian groups
- Orders of indescribable sets
- Weak presentations of computable partial orderings
- Limitwise monotonic sequences and degree spectra of structures
- Iterated effective embeddings of abelian p-groups
- On limitwise monotonicity and maximal block functions
- The computability path ordering
- scientific article; zbMATH DE number 3851063 (Why is no real title available?)
- The Settling Time Reducibility Ordering and Formula Sets
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- Orders on magmas and computability theory
- Examples of semicomputable sets of real and complex numbers
- Limitwise monotonic functions, sets, and degrees on computable domains
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Limitwise monotonic sets of reals
- Metric structures and probabilistic computation
- The settling-time reducibility ordering
- Comparing C.E. Sets Based on Their Settling Times
- η-representation of sets and degrees
- Computable shuffle sums of ordinals
This page was built for publication: Order-computable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469429)
