Recursively Enumerable Images of Arithmetic Sets

DOI10.1002/MALQ.19820281402MaRDI QIDQ3318762zbMATH OpenOpenAlexFDO

Authors Richard S. Rosenberg

Publication date 1982

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19820281402

zbMATH Keywords

arithmetic setPeano arithmeticpseudo-complementrecursively enumerable set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Recommendations

• scientific article; zbMATH DE number 1889701
• Relatively Recursively Enumerable Versus Relatively Σ₁ in Models of Peano Arithmetic
• Complete, Recursively Enumerable Relations in Arithmetic
• scientific article; zbMATH DE number 4197983
• Expressibility in the elementary theory of recursively enumerable sets with realizability logic

Cited in

(4)

• Partially generic formulas in arithmetic
• scientific article; zbMATH DE number 703133 (Why is no real title available?)
• Complete, Recursively Enumerable Relations in Arithmetic
• scientific article; zbMATH DE number 1889701 (Why is no real title available?)

This page was built for publication: Recursively Enumerable Images of Arithmetic Sets

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