## Abstract We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
On the complexity of categoricity in computable structures
β Scribed by Walker M. White
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 192 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We investigate the computational complexity the class of Ξβcategorical computable structures. We show that hyperarithmetic categoricity is Ξ ^1^~1~βcomplete, while computable categoricity is Ξ ^0^~4~βhard. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
## Abstract This paper continues our study of computable pointβfree topological spaces and the metamathematical points in them. For us, a __point__ is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a __sharp filter__. A function __f~F~__
This study investigates how everyday categorization experiences affect people's emotional responses and self-views. A representative Dutch population sample (N ΒΌ 463) was asked to recount a situation in which they were categorized by others. This resulted in a range of categories that were spontaneo
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of L p -computable functions (computable Lebesgue integrable functions) with a size notion, by introducing L p -computable Baire categories. We show that L p -computable Bair