Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

DOI10.2307/2048754zbMath0716.03039OpenAlexW4248695146MaRDI QIDQ3203015

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

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

Related Items (2)

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

Cites Work

• Elimination of quantifiers in algebraic structures
• Model theory
• Alfred Tarski's elimination theory for real closed fields
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item

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