Primitively recursive categoricity for unars and equivalence structures

DOI10.1134/S0037446621060033OpenAlexW3217709085MaRDI QIDQ2054224

K. V. Blinov

Publication date: 1 December 2021

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

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

zbMATH Keywords

unarsinjective structureequivalence structuredecidability with primitively recursive witnessesprimitively recursive categoricity

Mathematics Subject Classification ID

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

Related Items (1)

Generalization of Shapiro's theorem to higher arities and noninjective notations

Cites Work

• Unnamed Item
• Algebraic structures computable without delay
• Strongly \(\forall\)-finite theories of unars
• Autostability of models
• Categoricity for primitive recursive and polynomial Boolean algebras
• Primitively recursively categorical linear orderings
• Structures computable in polynomial time. I
• Effective categoricity of equivalence structures
• Computable categoricity of trees of finite height

This page was built for publication: Primitively recursive categoricity for unars and equivalence structures