Standard

A Computable Structure with Non-Standard Computability. / Avdeev, R. R.; Puzarenko, V. G.

в: Siberian Advances in Mathematics, Том 29, № 2, 01.04.2019, стр. 77-115.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Avdeev, RR & Puzarenko, VG 2019, 'A Computable Structure with Non-Standard Computability', Siberian Advances in Mathematics, Том. 29, № 2, стр. 77-115. https://doi.org/10.3103/S1055134419020019

APA

Avdeev, R. R., & Puzarenko, V. G. (2019). A Computable Structure with Non-Standard Computability. Siberian Advances in Mathematics, 29(2), 77-115. https://doi.org/10.3103/S1055134419020019

Vancouver

Avdeev RR, Puzarenko VG. A Computable Structure with Non-Standard Computability. Siberian Advances in Mathematics. 2019 апр. 1;29(2):77-115. doi: 10.3103/S1055134419020019

Author

Avdeev, R. R. ; Puzarenko, V. G. / A Computable Structure with Non-Standard Computability. в: Siberian Advances in Mathematics. 2019 ; Том 29, № 2. стр. 77-115.

BibTeX

@article{8346073c839242df91313e5bfdf46af2,
title = "A Computable Structure with Non-Standard Computability",
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-decidable model of an undecidable submodel complete theory.",
keywords = "admissible set, computable model, decidable model, hereditarily finite superstructure, hyperadmissible set, recursively saturated model, Σ-definability, Σ-reducibility",
author = "Avdeev, {R. R.} and Puzarenko, {V. G.}",
year = "2019",
month = apr,
day = "1",
doi = "10.3103/S1055134419020019",
language = "English",
volume = "29",
pages = "77--115",
journal = "Siberian Advances in Mathematics",
issn = "1055-1344",
publisher = "PLEIADES PUBLISHING INC",
number = "2",

}

RIS

TY - JOUR

T1 - A Computable Structure with Non-Standard Computability

AU - Avdeev, R. R.

AU - Puzarenko, V. G.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - 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.

AB - 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.

KW - admissible set

KW - computable model

KW - decidable model

KW - hereditarily finite superstructure

KW - hyperadmissible set

KW - recursively saturated model

KW - Σ-definability

KW - Σ-reducibility

UR - http://www.scopus.com/inward/record.url?scp=85067695211&partnerID=8YFLogxK

U2 - 10.3103/S1055134419020019

DO - 10.3103/S1055134419020019

M3 - Article

AN - SCOPUS:85067695211

VL - 29

SP - 77

EP - 115

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 2

ER -

ID: 20643116