## 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)
The complexity of countable categoricity in finite languages
β Scribed by Aleksander Ivanov
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 139 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
π SIMILAR VOLUMES
"[A] sensitive, finely wrought debut ... sharply observant of immigrants' intricate relationships to their adopted homelands, this exciting novel announces the arrival of a psychologically and socially astute new writer." -Kirkus Reviews (starred review) A mesmerizing debut novel of an Egyptian Amer
We give a complete resolution to a conjecture regarding the characterisation of linear complexities of span 1 de Bruijn sequences over nonprime finite fields. This contrasts with results for prime fields, where the characterisation is equivalent to an open question concerning permutation polynomials
His god -- Panopticon -- Privacy -- What do you know about shame -- Privacy 2 -- In the language -- Purgatory: a memoir/A son and a father of sons -- Banjo Yes receives a lifetime achievement award -- Banjo Yes recalls his first movies -- Banjo Yes talks about his first white wife -- Banjo Yes pluck
Acclaimed poet Shane McCrae's latest collection is a book about freedom told through stories of captivity. Historical persona poems and a prose memoir at the center of the book address the illusory freedom of both black and white Americans. In the book's three sequences, McCrae explores the role mas