Additive structure in uncountable models for a fixed completion of P

DOI10.2307/2273454zbMath0549.03026OpenAlexW2063084060MaRDI QIDQ3342546

Julia F. Knight

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273454

zbMATH Keywords

Presburger Arithmeticexpandabilityideal of Turing degreesuncountable recursively saturated models

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)

Related Items (1)

Degrees of Recursively Saturated Models

Cites Work

• Degrees of Unsolvability. (AM-55)

This page was built for publication: Additive structure in uncountable models for a fixed completion of P