✦ LIBER ✦

Categoricity of computable infinitary theories

✍ Scribed by W. Calvert; S. S. Goncharov; J. F. Knight; Jessica Millar

Publisher: Springer
Year: 2008
Tongue: English
Weight: 219 KB
Volume: 48
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-008-0117-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degrees of categoricity of computable st

Degrees of categoricity of computable structures

✍ Ekaterina B. Fokina; Iskander Kalimullin; Russell Miller 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 321 KB

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)

Spectra of computable models for Ehrenfe

Spectra of computable models for Ehrenfeucht theories

✍ A. N. Gavryushkin 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 195 KB

The categoricity of the group of all com

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

✍ A. S. Morozov; J. K. Truss 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 195 KB

Countable models of(kappa _1 )-categoric

Countable models of(kappa _1 )-categorical but not(kappa _0 )-categorical theories-categorical theories

✍ T. G. Mustafin; A. D. Taimanov 📂 Article 📅 1970 🏛 Springer US 🌐 English ⚖ 228 KB

Tiny models of categorical theories

✍ M. C. Laskowski; A. Pillay; P. Rothmaler 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 707 KB