✦ LIBER ✦

Degrees of categoricity of computable structures

✍ Scribed by Ekaterina B. Fokina; Iskander Kalimullin; Russell Miller

Publisher: Springer
Year: 2009
Tongue: English
Weight: 321 KB
Volume: 49
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-009-0160-4

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)

Categoricity of computable infinitary th

Categoricity of computable infinitary theories

✍ W. Calvert; S. S. Goncharov; J. F. Knight; Jessica Millar 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 219 KB

Turing degrees of hypersimple relations

Turing degrees of hypersimple relations on computable structures

✍ Valentina S. Harizanov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Let A be an inÿnite computable structure, and let R be an additional computable relation on its domain A. The syntactic notion of formal hypersimplicity of R on A, ÿrst introduced and studied by Hird, is analogous to the computability-theoretic notion of hypersimplicity of R on A, given the deÿnabil

Effective categoricity of equivalence st

Effective categoricity of equivalence structures

✍ Wesley Calvert; Douglas Cenzer; Valentina Harizanov; Andrei Morozov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 327 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

On Turing degrees of points in computabl

On Turing degrees of points in computable topology

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