COMPUTABLE LINEAR ORDERS AND PRODUCTS

DOI10.1017/JSL.2020.17MaRDI QIDQ5148100zbMATH OpenOpenAlexFDO

Authors

Publication date 29 January 2021

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/10356/146870

zbMATH Keywords

computable linear ordercomputable structureproduct of linear orderings

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computable linear orders and the Ershov hierarchy
• Computable linear orders and the ershov hierarchy
• scientific article; zbMATH DE number 1303201
• Computable embeddings for pairs of linear orders
• Computable linearizations of well-partial-orderings
• Computable presentability of countable linear orders
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Decidable discrete linear orders
• Orders on computable rings
• Computable linear orders and limitwise monotonic functions

Cites work

• Computability on linear orderings enriched with predicates
• Computable structures and the hyperarithmetical hierarchy
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Orderings with αth Jump Degree 0 (α)
• Δ 2 0 -copies of linear orderings

Cited in

(15)

• Countable indecomposable dispersed order types
• On initial segments of computable linear orders
• Cohesive powers of linear orders
• Computable linearizations of well-partial-orderings
• On self-embeddings of computable linear orderings
• Prime models of theories of computable linear orderings
• scientific article; zbMATH DE number 3863258 (Why is no real title available?)
• Linear Order Types of Nonrecursive Presentability
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• Initial segments of computable linear orders with additional computable predicates
• Computable choice functions for computable linear orderings
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Computability and uncountable linear orders. I: Computable categoricity.
• A class of low linear orders having computable presentations
• Countably complementable linear orderings

This page was built for publication: COMPUTABLE LINEAR ORDERS AND PRODUCTS

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