电邮这篇文章 Index Sets of Constructive Models of Finite and Graph Signatures that are Autostable Relative to Strong Constructivizations
- 作者: Goncharov S.S.1,2, Marchuk M.I.1
-
隶属关系:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- 期: 卷 54, 编号 6 (2016)
- 页面: 428-439
- 栏目: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/233960
- DOI: https://doi.org/10.1007/s10469-016-9365-x
- ID: 233960
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
We estimate algorithmic complexity of the class of computable models of finite and graph signatures that have a strong constructivization and are autostable relative to strong constructivizations.
作者简介
S. Goncharov
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
M. Marchuk
Sobolev Institute of Mathematics
编辑信件的主要联系方式.
Email: margaretmarchuk@gmail.com
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090
补充文件
