期刊
ALGEBRA AND LOGIC
卷 55, 期 6, 页码 421-435出版社
SPRINGER
DOI: 10.1007/s10469-017-9416-y
关键词
locally finite structure; computable structure; structure computable in polynomial time; polynomially categorical structure; weakly polynomially categorical structure
类别
资金
- RFBR [14-01-00376]
It is proved that every computable locally finite structure with finitely many functions has a presentation computable in polynomial time. Furthermore, a structure computable in polynomial time is polynomially categorical iff it is finite. If a structure is computable in polynomial time and locally finite then it is weakly polynomially categorical (i.e., categorical with respect to primitive recursive isomorphisms) iff it is finite.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据