Generically computable linear orderings

DOI10.1016/J.APAL.2025.103612MaRDI QIDQ6970287zbMATH OpenFDO

Authors Wesley Calvert, Douglas Cenzer, David Gonzalez, Valentina Harizanov

Publication date 18 June 2025

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APAL.2025.103612

zbMATH Keywords

\( \Sigma_\alpha\) elementary substructurecoarse computabilitygeneric computabilitylinear ordering

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Total orders (06A05)

Cites work

• η-representation of sets and degrees
• Asymptotic density and the theory of computability: a partial survey
• Autostability of models
• Computable shuffle sums of ordinals
• Computable structures and the hyperarithmetical hierarchy
• Degrees coded in jumps of orderings
• Degrees of orderings not isomorphic to recursive linear orderings
• Degrees of Structures
• Densely computable structures
• Enumerations in computable structure theory
• Extraction rates of random continuous functionals
• Formal definitions in the theory of ordinal numbers.
• Generic computability, Turing degrees, and asymptotic density
• Generic-case complexity, decision problems in group theory, and random walks.
• Generically and coarsely computable isomorphisms
• scientific article; zbMATH DE number 3732037 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• scientific article; zbMATH DE number 3198885 (Why is no real title available?)
• On the algorithmic insolvability of the word problem in group theory
• Orderings with αth Jump Degree 0 (α)
• Recursive Enumerability and the Jump Operator
• Recursive Pseudo-Well-Orderings
• Recursively Categorical Linear Orderings
• Retraceable Sets
• Scott sentence complexities of linear orderings
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• The word problem

This page was built for publication: Generically computable linear orderings

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