A Computable Structure with Non-Standard Computability

A Computable Structure with Non-Standard Computability Full article

Journal

Siberian Advances in Mathematics
ISSN: 1055-1344 , E-ISSN: 1934-8126

Output data

Year: 2019, Volume: 29, Number: 2, Pages: 77-115 Pages count : 39 DOI: 10.3103/S1055134419020019

Tags

admissible set; computable model; decidable model; hereditarily finite superstructure; hyperadmissible set; recursively saturated model; Σ-definability; Σ-reducibility

Authors

Avdeev R.R. ¹ , Puzarenko V.G. ^1,2

Affiliations

1	Novosibirsk State University, Novosibirsk, 630090, Russian Federation
2	Sobolev Institute of Mathematics, Novosibirsk, 630090, Russian Federation

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. © 2019, Allerton Press, Inc.

Avdeev R.R. , Puzarenko V.G.
A Computable Structure with Non-Standard Computability
Siberian Advances in Mathematics. 2019. V.29. N2. P.77-115. DOI: 10.3103/S1055134419020019 Scopus OpenAlex

Авдеев Р.Р. , Пузаренко В.Г.
Вычислимая структура с нестандартной вычислимостью
Математические труды. 2018. Т.21. №2. С.3-60. DOI: 10.17377/mattrudy.2018.21.201

Scopus:	2-s2.0-85067695211
OpenAlex:	W2947474490

Пока нет цитирований