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 条

[1] Complexity of categorical theories with computable models
Goncharov S.S.
Khoussainov B.
Algebra and Logic, 2004, 43 (6) : 365 - 373
[2] Complexity of categorical theories with computable models
Goncharov, SS
Khusainov, BK
DOKLADY MATHEMATICS, 2002, 66 (01) : 52 - 54
[3] Spectra of computable models for Ehrenfeucht theories
A. N. Gavryushkin
Algebra and Logic, 2007, 46 : 149 - 157
[4] Spectra of computable models for Ehrenfeucht theories
Gavryushkin, A. N.
ALGEBRA AND LOGIC, 2007, 46 (03) : 149 - 157
[5] COMPLEXITY CONCEPTS AND THE LIMITATIONS OF COMPUTABLE MODELS
SIMON, JC
TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE, 1979, 13 (01) : 1 - 11
[6] Prime models of theories of computable linear orderings
Hirschfeldt, DR
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2001, 129 (10) : 3079 - 3083
[7] Estimation of the algorithmic complexity of classes of computable models
Pavlovskii, E. N.
SIBERIAN MATHEMATICAL JOURNAL, 2008, 49 (03) : 512 - 523
[8] Estimation of the algorithmic complexity of classes of computable models
E. N. Pavlovskii
Siberian Mathematical Journal, 2008, 49 : 512 - 523
[9] Arithmetic turing degrees and categorical theories of computable models
Fokina, E.
MATHEMATICAL LOGIC IN ASIA, 2006, : 58 - 69
[10] Non-computable Models of Certain First Order Theories
Sagi, Gabor
Horvath, Ramon
2017 IEEE 14TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATICS, 2017, : 306 - 312

← 1 2 3 4 5 →