Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

DOI10.2307/2048754MaRDI QIDQ3203015zbMATH OpenOpenAlexFDO

Authors Christian Michaux

Publication date 1991

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

zbMATH Keywords

recursively enumerable setsreal closed fieldscomputation theory over commutative ordered ringsoutput sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
• scientific article; zbMATH DE number 446847
• scientific article; zbMATH DE number 627413
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Publication:3033315

Cites work

• scientific article; zbMATH DE number 503387 (Why is no real title available?)
• scientific article; zbMATH DE number 3382339 (Why is no real title available?)
• Alfred Tarski's elimination theory for real closed fields
• Computable Algebra, General Theory and Theory of Computable Fields
• Elimination of quantifiers in algebraic structures
• Model theory
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Cited in

(4)

• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
• Real computational universality: the word problem for a class of groups with infinite presentation
• scientific article; zbMATH DE number 627413 (Why is no real title available?)
• On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine

This page was built for publication: Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

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