Primitively recursively categorical linear orderings

DOI10.1134/S0037446619010038MaRDI QIDQ2002476zbMATH OpenOpenAlexWikidataFDO

Authors 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

decidability with primitively recursive witnesseslinear orderingprimitively recursive categoricity

Mathematics Subject Classification ID

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

Cites work

• Algebraic structures computable without delay
• Autostability of models
• Categoricity for primitive recursive and polynomial Boolean algebras
• scientific article; zbMATH DE number 58131 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Recursively Categorical Linear Orderings
• Structures computable in polynomial time. I

Cited in

(9)

• Primitively recursive categoricity for unars and equivalence structures
• Online presentations of finitely generated structures
• scientific article; zbMATH DE number 3557788 (Why is no real title available?)
• scientific article; zbMATH DE number 463967 (Why is no real title available?)
• Categorical characterizations of the natural numbers require primitive recursion
• scientific article; zbMATH DE number 1827968 (Why is no real title available?)
• Punctually presented structures I: Closure theorems
• A pathological punctually 1-decidable structure
• Punctually presented structures. II: Comparing presentations.

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

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