Pages that link to "Item:Q3710515"
From MaRDI portal
The following pages link to A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings (Q3710515):
Displayed 11 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Cuts of linear orders (Q651418) (← links)
- Finite condensations of recursive linear orders (Q1120568) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983) (← links)
- Depth zero Boolean algebras (Q3581139) (← links)
- On computable self-embeddings of computable linear orderings (Q3655260) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)