Linear Order Types of Nonrecursive Presentability

DOI10.1002/MALQ.19850313104MaRDI QIDQ3695272zbMATH OpenOpenAlexFDO

Authors Dev K. Roy

Publication date 1985

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19850313104

zbMATH Keywords

arithmetical hierarchyfinite condensationhierarchy of arithmetically presented linear order typesrationals modulo a congruence relation

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Total orders (06A05)

Recommendations

• Linear Order Types of Nonrecursive Presentability
• Finite condensations of recursive linear orders
• On a computable presentation of low linear orderings
• COMPUTABLE LINEAR ORDERS AND PRODUCTS
• Low linear orderings

Cited in

(6)

• Finite condensations of recursive linear orders
• Weakly semirecursive sets and r.e. orderings
• Definability of linear orders over negative equivalences
• Linear Order Types of Nonrecursive Presentability
• scientific article; zbMATH DE number 1873432 (Why is no real title available?)
• Up to equimorphism, hyperarithmetic is recursive

This page was built for publication: Linear Order Types of Nonrecursive Presentability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695272)