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: | Melnikov, Alexander, Ng, Keng Meng |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2021
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/152039 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Punctual categoricity and universality
由: Downey, Rod, et al.
出版: (2022) -
Computably and punctually universal spaces
由: Bagaviev, Ramil, et al.
出版: (2024) -
Tight distance-regular graphs and the Q-polynomial property
由: Pascasio, Arlene A.
出版: (2001) -
On the polynomial x3 + y3 + z3 - 3xyz
由: Barrera, Eudora, et al.
出版: (1993) -
On generalized Bell polynomials
由: Corcino, Roberto B., et al.
出版: (2011)