Q3773855
type: Item
instance of: scholarly article
zbMATH Open document ID: 0635.03028
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03C30
Mathematics Subject Classification ID: 03H15
zbMATH DE Number: 4033714
zbMATH Keywords: Turing degrees
zbMATH Keywords: models of arithmetic
zbMATH Keywords: effective enumeration
zbMATH Keywords: Scott set
zbMATH Keywords: Harrington style construction
zbMATH Keywords: infinitely many Workers
zbMATH Keywords: Solovay's theorem
zbMATH Keywords: Harrington's theorem
author: J. F. Knight
MaRDI profile type: Publication
Recommended article: Degrees of Recursively Saturated Models
Recommended article: Model-theoretic properties of the \(n\)-c.e. degrees
Recommended article: The degree spectra of homogeneous models
Recommended article: Decidability of Scott's model as an ordered ℚ-vectorspace
Recommended article: Representing Scott sets in algebraic settings
Recommended article: Scott's problem for Proper Scott sets
Recommended article: Computability in structures representing a Scott set
Recommended article: SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
Recommended article: Model theory of the computably enumerable many-one degrees
Recommended article: A CLASS OF MODELS FOR SKALA'S SET THEORY
description: scientific article