𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The categoricity of the group of all computable automorphisms of the rational numbers

✍ Scribed by A. S. Morozov; J. K. Truss

Publisher
Springer US
Year
2007
Tongue
English
Weight
195 KB
Volume
46
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of categoricity in com
On the complexity of categoricity in computable structures
✍ Walker M. White πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

## 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)