✦ LIBER ✦

Complexity and Categoricity

✍ Scribed by Douglas Cenzer; Jeffrey B. Remmel

Book ID: 112252316
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 516 KB
Volume: 140
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2676

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)

The complexity of countable categoricity

The complexity of countable categoricity in finite languages

✍ 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.

Countable categoricity

✍ K. Zh. Kudaibergenov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 158 KB

Categoricity, amalgamation, and tameness

✍ John T. Baldwin; Alexei Kolesnikov 📂 Article 📅 2009 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 356 KB

Urn models and categoricity

✍ Philip Olin 📂 Article 📅 1978 🏛 Springer Netherlands 🌐 English ⚖ 739 KB

Strong Δ20categoricity

✍ C. J. Ash; S. S. Goncharov 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 433 KB