Punctual 1-linear orders

DOI10.1134/s1995080223070168OpenAlexW4388000619MaRDI QIDQ6059288

M. V. Zubkov, Andrei N. Frolov

Publication date: 2 November 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223070168

zbMATH Keywords

linear ordersuccessor relationpunctual structure

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Ordered sets (06Axx) Model theory (03Cxx)

Cites Work

• Initial segments of computable linear orders with additional computable predicates
• Algebraic structures computable without delay
• Linear orderings of low degree
• Presentations of the successor relation of computable linear ordering
• Degree spectra of the successor relation of computable linear orderings
• Recursive linear orders with recursive successivities
• Polynomial-time Abelian groups
• Punctual copies of algebraic structures
• Graphs are not universal for online computability
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Notes on the Jump of a Structure
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Δ 2 0 -copies of linear orderings

This page was built for publication: Punctual 1-linear orders