|
A computable structure with non-standard computability
R. R. Avdeeva, V. G. Puzarenkoab a Novosibirsk State University, Novosibirsk, 630090 Russia
b Sobolev Institute of Mathematics, Novosibirsk, 630090 Russia
Abstract:
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$ model of an undecidable submodel complete theory.
Key words:
admissible set, hyperadmissible set, hereditarily finite superstructure, recursively saturated model, computable model, decidable model, $\Sigma$-reducibility, $\Sigma$-definability.
Received: 13.09.2017
Citation:
R. R. Avdeev, V. G. Puzarenko, “A computable structure with non-standard computability”, Mat. Tr., 21:2 (2018), 3–60; Siberian Adv. Math., 29:2 (2019), 77–115
Linking options:
https://www.mathnet.ru/eng/mt337 https://www.mathnet.ru/eng/mt/v21/i2/p3
|
|