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 条
  • [31] A linearly computable measure of string complexity
    Becher, Veronica
    Heiber, Pablo Ariel
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 62 - 73
  • [32] Small Complexity Classes for Computable Analysis
    Kawamura, Akitoshi
    Ota, Hiroyuki
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 432 - 444
  • [33] The complexity and generative capacity of lexicalized abstract categorial grammars
    Yoshinaka, R
    Kanazawa, M
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 2005, 3492 : 330 - 346
  • [34] MODELS OF BOUNDED ARITHMETIC THEORIES AND SOME RELATED COMPLEXITY QUESTIONS
    Alam, Abolfazl
    Moniri, Morteza
    BULLETIN OF THE SECTION OF LOGIC, 2022, 51 (02): : 163 - 176
  • [35] Index sets of computable structures with decidable theories
    Fokina, Ekaterina B.
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 290 - 296
  • [36] COMPUTABLE LINDLEY PROCESSES IN QUEUEING AND RISK THEORIES
    Raducan, Ana-Maria
    Lakatos, Laszlo
    Zbaganu, Gheorghita
    REVUE ROUMAINE DE MATHEMATIQUES PURES ET APPLIQUEES, 2008, 53 (2-3): : 239 - 266
  • [37] FINITE AXIOMATIZABILITY FOR EQUATIONAL THEORIES OF COMPUTABLE GROUPOIDS
    PERKINS, P
    JOURNAL OF SYMBOLIC LOGIC, 1989, 54 (03) : 1018 - 1022
  • [38] The complexity of central series in nilpotent computable groups
    Csima, Barbara F.
    Solomon, Reed
    ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (08) : 667 - 678
  • [39] ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
    Downey, Rod
    Lempp, Steffen
    Wu, Guohua
    JOURNAL OF MATHEMATICAL LOGIC, 2010, 10 (1-2) : 83 - 99
  • [40] The Complexity of Primes in Computable Unique Factorization Domains
    Dzhafarov, Damir D.
    Mileti, Joseph R.
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2018, 59 (02) : 139 - 156
12345