This article is cited in 12 papers

Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations

S. S. Goncharov^ab, M. I. Marchuk<sup>a

a</sup> Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia
^b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

Abstract: We estimate algorithmic complexity of the class of computable models of a finite and a graph signature that have a strong constructivization and are autostable relative to strong constructivizations.

Keywords: model, computable model, constructive model, autostability, index sets.

UDC: 510.5

Received: 15.03.2015

DOI: 10.17377/alglog.2015.54.602

 English version: Algebra and Logic, 2016, 54:6, 428–439

Bibliographic databases:

• 
• 
•