A structure of punctual dimension two

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Melnikov, Alexander, Ng, Keng Meng
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2021
Subjects:
Science::Mathematics
Polynomial-time
Model-theory
Online Access:https://hdl.handle.net/10356/152039
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-152039
record_format dspace
spelling sg-ntu-dr.10356-1520392023-02-28T19:55:31Z A structure of punctual dimension two Melnikov, Alexander Ng, Keng Meng School of Physical and Mathematical Sciences Division of Mathematics Sciences Science::Mathematics Polynomial-time Model-theory 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. Ministry of Education (MOE) Accepted version The first author was partially supported by the Marsden Foundation of New Zealand. The second author was partially supported by the grants MOE2015-T2-2-055 and RG131/17. 2021-07-30T08:47:24Z 2021-07-30T08:47:24Z 2020 Journal Article Melnikov, A. & Ng, K. M. (2020). A structure of punctual dimension two. Proceedings of the American Mathematical Society, 148(7), 3113-3128. https://dx.doi.org/10.1090/proc/15020 0002-9939 https://hdl.handle.net/10356/152039 10.1090/proc/15020 2-s2.0-85085973627 7 148 3113 3128 en MOE2015-T2-2-055 RG131/17 Proceedings of the American Mathematical Society © 2020 American Mathematical Society. All rights reserved. This paper was published in Proceedings of the American Mathematical Society and is made available with permission of American Mathematical Society. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics
Polynomial-time
Model-theory
spellingShingle Science::Mathematics
Polynomial-time
Model-theory
Melnikov, Alexander
Ng, Keng Meng
A structure of punctual dimension two
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Melnikov, Alexander
Ng, Keng Meng
format Article
author Melnikov, Alexander
Ng, Keng Meng
author_sort Melnikov, Alexander
title A structure of punctual dimension two
title_short A structure of punctual dimension two
title_full A structure of punctual dimension two
title_fullStr A structure of punctual dimension two
title_full_unstemmed A structure of punctual dimension two
title_sort structure of punctual dimension two
publishDate 2021
url https://hdl.handle.net/10356/152039
_version_ 1759853301179875328

Similar Items