论文信息 - Primitively Recursively Categorical Linear Orderings

Primitively Recursively Categorical Linear Orderings

We prove that linear orderings are primitively recursively categorical over a class of structures KΣ if and only if they contain only finitely many successivities.

K. V. Blinov

[1] P. E. Alaev,et al. Structures Computable in Polynomial Time. I , 2017 .

[2] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[3] Douglas Cenzer,et al. Complexity Theoretic Model Theory and Algebra , 2013 .

[4] Jeffrey B. Remmel. Recursively categorical linear orderings , 1981 .

[5] S. S. Goncharov,et al. Autostability of models , 1980 .

[6] Keng Meng Ng,et al. Algebraic structures computable without delay , 2017, Theor. Comput. Sci..

[7] P. E. Alaev. Categoricity for Primitive Recursive and Polynomial Boolean Algebras , 2018, Algebra and Logic.