The Diversity of Categoricity Without Delay

We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new de nitions are non-equivalent. In this note we give only proof sketches, complete proof will appear in t...

Full description

Saved in:
Bibliographic Details
Main Authors: Kalimullin, I. S., Melnikov, A. G., Ng, Keng Meng
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2017
Subjects:
Online Access:https://hdl.handle.net/10356/83375
http://hdl.handle.net/10220/43537
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-83375
record_format dspace
spelling sg-ntu-dr.10356-833752023-02-28T19:32:48Z The Diversity of Categoricity Without Delay Kalimullin, I. S. Melnikov, A. G. Ng, Keng Meng School of Physical and Mathematical Sciences Fully primitive recursivity Categoricity We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new de nitions are non-equivalent. In this note we give only proof sketches, complete proof will appear in the full version of the paper. MOE (Min. of Education, S’pore) Accepted version 2017-08-03T07:22:01Z 2019-12-06T15:21:04Z 2017-08-03T07:22:01Z 2019-12-06T15:21:04Z 2017 Journal Article Kalimullin, I. S., Melnikov, A. G., & Ng, K. M. (2017). The Diversity of Categoricity Without Delay. Algebra and Logic, 56(2), 171-177. 0002-5232 https://hdl.handle.net/10356/83375 http://hdl.handle.net/10220/43537 10.1007/s10469-017-9437-6 en Algebra and Logic © 2017 Springer Science+Business Media. This is the author created version of a work that has been peer reviewed and accepted for publication by Algebra and Logic, Springer Science+Business Media. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/s10469-017-9437-6]. 8 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Fully primitive recursivity
Categoricity
spellingShingle Fully primitive recursivity
Categoricity
Kalimullin, I. S.
Melnikov, A. G.
Ng, Keng Meng
The Diversity of Categoricity Without Delay
description We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new de nitions are non-equivalent. In this note we give only proof sketches, complete proof will appear in the full version of the paper.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Kalimullin, I. S.
Melnikov, A. G.
Ng, Keng Meng
format Article
author Kalimullin, I. S.
Melnikov, A. G.
Ng, Keng Meng
author_sort Kalimullin, I. S.
title The Diversity of Categoricity Without Delay
title_short The Diversity of Categoricity Without Delay
title_full The Diversity of Categoricity Without Delay
title_fullStr The Diversity of Categoricity Without Delay
title_full_unstemmed The Diversity of Categoricity Without Delay
title_sort diversity of categoricity without delay
publishDate 2017
url https://hdl.handle.net/10356/83375
http://hdl.handle.net/10220/43537
_version_ 1759854665386688512