𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


The complexity of countable categoricity
✍ Aleksander Ivanov πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

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

On the computation of complex equilibria
✍ Y. H. Ma; C. W. Shipman πŸ“‚ Article πŸ“… 1972 πŸ› American Institute of Chemical Engineers 🌐 English βš– 577 KB
On Turing degrees of points in computabl
✍ Iraj Kalantari; Larry Welch πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## 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~__

Categorization in everyday life: the eff
✍ Naomi Ellemers; Manuela Barreto πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 100 KB πŸ‘ 2 views

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

On the convergence of Fourier series of
✍ Philippe Moser πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 130 KB

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