Computable reducibility for computable linear orders of type \(\omega \)

DOI10.1007/s10958-022-06148-5OpenAlexW4308158024MaRDI QIDQ6187991

A. Askarbekkyzy, B. S. Kalmurzayev, Nikolay Bazhenov

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-022-06148-5

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Algebraic structures computable without delay
• Concerning partial recursive similarity transformations of linearly ordered sets
• Turing degrees of certain isomorphic images of computable relations
• Positive equivalences
• The diversity of categoricity without delay
• Positive preorders
• On bi-embeddable categoricity of algebraic structures
• Special classes of positive preorders
• The structure of computably enumerable preorder relations
• The back-and-forth method and computability without delay
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• Classifying positive equivalence relations
• Degrees of bi-embeddable categoricity
• Bi‐embeddability spectra and bases of spectra
• Joins and meets in the structure of ceers
• Computably enumerable equivalence relations

This page was built for publication: Computable reducibility for computable linear orders of type \(\omega \)