Finite condensations of recursive linear orders

DOI10.1007/BF00671562zbMath0673.03034OpenAlexW2074465079MaRDI QIDQ1120568

Dev K. Roy, Richard Watnick

Publication date: 1988

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00671562

zbMATH Keywords

arithmetical hierarchyfinite condensation of a recursive linear order type

Mathematics Subject Classification ID

Total orders (06A05) Hierarchies of computability and definability (03D55)

Related Items (1)

Recursive Linear Orders with Incomplete Successivities

Cites Work

• R. e. presented linear orders
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• Linear Order Types of Nonrecursive Presentability

This page was built for publication: Finite condensations of recursive linear orders