Punctual Categoricity Relative to a Computable Oracle

Abstract

Abstract: We are studying the punctual structures, i.e., the primitive recursive structures on the whole set of integers. The punctual categoricity relative to a computable oracle f means that between any two punctual copies of a structure there is an isomorphism which togeteher with its inverse can be derived via primitive recursive schemes augmented with f. We will prove that the punctual categoricity relative to a computable oracle can hold only for finitely generated or locally finite structures. We will show that the punctual categoricity of finitely generated structures is exhaused by the computable oracles with primitive recursive graph. We also present an example of locally finite structure where the punctual categoricity is provided by a primitive recursively bounded computable oracle.