Complexity of countable categoricity in finite languages
Logic
2011-01-21 v1
Authors:
A. Ivanov
Abstract
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
Cite
@article{arxiv.1101.3792,
title = {Complexity of countable categoricity in finite languages},
author = {A. Ivanov},
journal= {arXiv preprint arXiv:1101.3792},
year = {2011}
}
Comments
16 pages
Related papers
View all related →
Logic · Mathematics
The complexity of the index sets of $\aleph_0$-categorical theories and of Ehrenfeucht theories
Steffen Lempp, Theodore A. Slaman
2007-05-23
Computational Complexity · Computer Science
Extension Complexity of Formal Languages
Hans Raj Tiwary
2019-08-29
Logic · Mathematics
The classification of countable models of set theory
John Clemens, Samuel Coskey, Samuel Dworetzky
2020-07-21
Logic · Mathematics
Index Sets of Computable Structures
Wesley Calvert, Valentina S. Harizanov, Julia F. Knight, Sara Miller
2008-03-25
Computational Complexity · Computer Science
On The Liniar Time Complexity of Finite Languages
Mircea Alexandru Popescu Moscu
2007-05-23
Formal Languages and Automata Theory · Computer Science
Nonterminal complexity of some families of infinite regular languages
Dmitry Golubenko
2021-03-23
Formal Languages and Automata Theory · Computer Science
Words with unbounded periodicity complexity
Štěpán Holub
2019-12-18
Logic · Mathematics
Combinations related to classes of finite and countably categorical structures and their theories
Sergey V. Sudoplatov
2017-01-04
Computational Complexity · Computer Science
A Complexity Theory for Hard Enumeration Problems
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek +1
2017-10-25
Logic · Mathematics
Calibrating word problems of groups via the complexity of equivalence relations
André Nies, Andrea Sorbi
2016-09-13
Artificial Intelligence · Computer Science
The Complexity of Bayesian Networks Specified by Propositional and Relational Languages
Fabio Gagliardi Cozman, Denis Deratani Mauá
2017-01-09
Logic in Computer Science · Computer Science
On the strictness of the quantifier structure hierarchy in first-order logic
Yuguo He
2015-07-01
Algebraic Geometry · Mathematics
Classification of singularities of cluster algebras of finite type II: coefficients
Angélica Benito, Eleonore Faber, Hussein Mourtada, Bernd Schober
2025-09-23
Formal Languages and Automata Theory · Computer Science
The complexity of downward closures of indexed languages
Richard Mandel, Corto Mascle, Georg Zetzsche
2026-05-28
Logic · Mathematics
The number of countable models of first-order theories
Anand Pillay, Predrag Tanović
2025-08-12
Artificial Intelligence · Computer Science
Existential Rule Languages with Finite Chase: Complexity and Expressiveness
Heng Zhang, Yan Zhang, Jia-Huai You
2015-01-12
Combinatorics · Mathematics
Counting Finite Languages by Total Word Length
Stefan Gerhold
2010-01-26
Logic · Mathematics
Describing Groups
Meng-Che Ho
2016-04-19
Logic · Mathematics
Complexity of deep computations via topology of function spaces
Eduardo Dueñez, José Iovino, Tonatiuh Matos-Wiederhold, Luciano Salvetti +1
2026-02-19
Logic in Computer Science · Computer Science
Algebraic recognizability of languages
Pascal Weil
2007-05-23
Logic · Mathematics
Incompleteness in the finite domain
Pavel Pudlak
2017-05-22
Combinatorics · Mathematics
Counting Finite Topologies
Eldar Fischer, Johann A. Makowsky
2024-01-02
Combinatorics · Mathematics
Complexity problems in enumerative combinatorics
Igor Pak
2018-04-03
Logic in Computer Science · Computer Science
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Ian Pratt-Hartmann
2024-04-19
Logic · Mathematics
Classifying word problems of finitely generated algebras via computable reducibility
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
2023-05-22