Additive structure in uncountable models for a fixed completion of P

DOI10.2307/2273454MaRDI QIDQ3342546zbMATH OpenOpenAlexFDO

Authors J. 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

expandabilityideal of Turing degreesPresburger Arithmeticuncountable recursively saturated models

Mathematics Subject Classification ID

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

Recommendations

• ω₁-like recursively saturated models of Presburger's arithmetic
• scientific article; zbMATH DE number 32280
• scientific article; zbMATH DE number 4112569
• scientific article; zbMATH DE number 4045724
• Degrees of Recursively Saturated Models

Cites work

• Degrees of Unsolvability. (AM-55)

Cited in

(6)

• Transplendent models: expansions omitting a type
• Degrees of Recursively Saturated Models
• ω₁-like recursively saturated models of Presburger's arithmetic
• scientific article; zbMATH DE number 4045724 (Why is no real title available?)
• scientific article; zbMATH DE number 4112569 (Why is no real title available?)
• Rigid models of Presburger arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342546)