Punctual Copies of Algebraic Structures
Siberian Mathematical Journal(2020)
摘要
We estimate the complexity of constructing a punctual “online” copy of an algebraic structure. We establish a general upper bound as well as optimal bounds for classes of Boolean algebras, abelian p -groups, and linear orders. Moreover, the methods developed here are applied to solving Montalbán’s open problem (2013) about copyable linear orders.
更多查看译文
关键词
primitive recursion,computable structures,online model theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络