The complexity of countable categoricity in finite languages

被引：0

作者：

Ivanov, Aleksander ^{[1
]}

机构：

[1] Univ Wroclaw, Inst Math, PL-50384 Wroclaw, Poland

来源：

关键词：

Index sets; countably categorical theories; Ehrenfeucht theories; MSC (2010) 03C57; 03D80;

D O I：

10.1002/malq.201110035

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.

引用

页码：105 / 112

页数：8

共 50 条

[1] Atomic Toposes and Countable Categoricity
Olivia Caramello
[J]. Applied Categorical Structures, 2012, 20 : 379 - 391
[2] Atomic Toposes and Countable Categoricity
Caramello, Olivia
[J]. APPLIED CATEGORICAL STRUCTURES, 2012, 20 (04) : 379 - 391
[3] Complexity and categoricity
Cenzer, D
Remmel, JB
[J]. INFORMATION AND COMPUTATION, 1998, 140 (01) : 2 - 25
[4] Complexity and Categoricity of Injection Structures Induced by Finite State Transducers
Krogman, Richard
Cenzer, Douglas
[J]. CONNECTING WITH COMPUTABILITY, 2021, 12813 : 106 - 119
[5] On the Grammatical Complexity of Finite Languages
Holzer, Markus
Wolfsteiner, Simon
[J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 151 - 162
[6] On the cover complexity of finite languages
Hetzl, Stefan
Wolfsteiner, Simon
[J]. THEORETICAL COMPUTER SCIENCE, 2019, 798 : 109 - 125
[7] Cover Complexity of Finite Languages
Hetzl, Stefan
Wolfsteiner, Simon
[J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 139 - 150
[8] The complexity of computable categoricity
Downey, Rodney G.
Kach, Asher M.
Lempp, Steffen
Lewis-Pye, Andrew E. M.
Montalban, Antonio
Turetsky, Daniel D.
[J]. ADVANCES IN MATHEMATICS, 2015, 268 : 423 - 466
[9] State complexity of finite partial languages
Kutrib, Martin
Wendlandt, Matthias
[J]. THEORETICAL COMPUTER SCIENCE, 2023, 966
[10] Topological complexity of locally finite ω-languages
Finkel, Olivier
[J]. ARCHIVE FOR MATHEMATICAL LOGIC, 2008, 47 (06) : 625 - 651