The Diversity of Categoricity Without Delay

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:
Fully primitive recursivity
Categoricity
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
Description
Summary: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.

Similar Items