A Computable Structure with Non-Standard Computability

We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.

Saved in:
Bibliographic Details
Published in:Siberian advances in mathematics 2019-04, Vol.29 (2), p.77-115
Main Authors: Avdeev, R. R., Puzarenko, V. G.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.
ISSN:1055-1344
1934-8126
DOI:10.3103/S1055134419020019