Linear orderings of low degree

DOI10.1007/S11202-010-0091-7zbMATH Open1209.03032OpenAlexW2038761581MaRDI QIDQ610306FDOQ610306

Authors: Sumit K. Garg 

Publication date: 8 December 2010

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11202-010-0091-7

Recommendations

• Degrees of orderings not isomorphic to recursive linear orderings
• On a computable presentation of low linear orderings
• Low linear orderings
• Computability on linear orderings enriched with predicates
• Δ 2 0 -copies of linear orderings

zbMATH Keywords

complexityorder typelinear orderingcomputable representationlow degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Δ 2 0 -copies of linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Degrees of orderings not isomorphic to recursive linear orderings

Cited In (25)

• Computable presentability of countable linear orders
• Negative dense linear orders
• Shuffling of Linear Orders
• Minimum Degree Orderings
• Embedding linear orders in grids
• Initial segments of computable linear orders with computable natural relations
• Computable linear orders and the Ershov hierarchy
• Punctual 1-linear orders
• Computability on linear orderings enriched with predicates
• Low linear orderings
• Computable linear orders and limitwise monotonic functions
• Computable linear orders and the ershov hierarchy
• A class of low linear orders having computable presentations
• Title not available (Why is that?)
• The linearity of the Mitchell order
• A computably enumerable partial ordering without computably enumerable maximal chains and antichains
• Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
• The dense linear ordering principle
• Degree spectra of structures
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Scattered linear orderings with no computable presentation
• On a computable presentation of low linear orderings
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
• Linear Orders in the Pushdown Hierarchy
• Adding linear orders

This page was built for publication: Linear orderings of low degree

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