Complexity of categorial theories with computable models

被引：0

|

作者：

Goncharov, S.S.

Khusainov, B.Kh.

机构：

来源：

Doklady Akademii Nauk | 2002年 / 385卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：299 / 302

相关论文

共 50 条

[21] Complexity for partial computable functions over computable Polish spaces
Korovina, Margarita
Kudinov, Oleg
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (03) : 429 - 447
[22] Descriptive complexity of computable sequences
Durand, B
Shen, A
Vereshchagin, N
THEORETICAL COMPUTER SCIENCE, 2002, 271 (1-2) : 47 - 58
[23] Orbit complexity by computable structures
Galatolo, S
NONLINEARITY, 2000, 13 (05) : 1531 - 1546
[24] Descriptive complexity of computable sequences
Durand, B
Shen, A
Vereshagin, N
STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 153 - 162
[25] Computable embeddings and strongly minimal theories
Chisholm, J.
Knight, J. F.
Miller, S.
JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (03) : 1031 - 1040
[26] THE COMPLEXITY OF ORDER-COMPUTABLE SETS
Wu, Huishan
JOURNAL OF SYMBOLIC LOGIC, 2025,
[27] Computational complexity on computable metric spaces
Weirauch, K
MATHEMATICAL LOGIC QUARTERLY, 2003, 49 (01) : 3 - 21
[28] Descriptive complexity of computable sequences revisited
Vereshchagin, Nikolay
THEORETICAL COMPUTER SCIENCE, 2020, 809 : 531 - 537
[29] Pointwise complexity of the derivative of a computable function
McCarthy, Ethan
ARCHIVE FOR MATHEMATICAL LOGIC, 2021, 60 (7-8) : 981 - 994
[30] Pointwise complexity of the derivative of a computable function
Ethan McCarthy
Archive for Mathematical Logic, 2021, 60 : 981 - 994

← 1 2 3 4 5 →