Primitively recursively categorical linear orderings

DOI10.1134/S0037446619010038zbMath1477.03145OpenAlexW2937879628WikidataQ128060411 ScholiaQ128060411MaRDI QIDQ2002476

K. V. Blinov

Publication date: 12 July 2019

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

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

zbMATH Keywords

linear orderingdecidability with primitively recursive witnessesprimitively recursive categoricity

Mathematics Subject Classification ID

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

Related Items

Punctually presented structures I: Closure theorems ⋮ Online presentations of finitely generated structures ⋮ Primitively recursive categoricity for unars and equivalence structures

Cites Work

• Algebraic structures computable without delay
• Autostability of models
• Categoricity for primitive recursive and polynomial Boolean algebras
• Structures computable in polynomial time. I
• Recursively Categorical Linear Orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Primitively recursively categorical linear orderings