Punctual 1-linear orders

DOI10.1134/S1995080223070168MaRDI QIDQ6059288zbMATH OpenOpenAlexFDO

Authors Andrey Frolov, M. V. Zubkov

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 orderpunctual structuresuccessor relation

Mathematics Subject Classification ID

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

Cites work

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

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

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