A structure of punctual dimension two
This paper contributes to the general program which aims to eliminate an unbounded search from proofs and procedures in computable structure theory. A countable structure in a finite language is punctual if its domain is ω and its operations and relations are primitive recursive. A function f is pun...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/152039 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This paper contributes to the general program which aims to eliminate an unbounded search from proofs and procedures in computable structure theory. A countable structure in a finite language is punctual if its domain is ω and its operations and relations are primitive recursive. A function f is punctual if both f and f⁻¹ are primitive recursive. We prove that there exists a countable rigid algebraic structure which has exactly two punctual presentations, up to punctual isomorphism. |
|---|