Isomorphism theorem for BSS recursively enumerable sets over real closed fields

DOI10.1016/S0304-3975(99)00103-6zbMath0951.68035MaRDI QIDQ1575912

Christophe Troestler, Christian Michaux

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

BSS computability

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computability and recursion theory (03D99)

Related Items (2)

Kolmogorov Complexity Theory over the Reals ⋮ Isomorphism theorem for BSS recursively enumerable sets over real closed fields

Cites Work

• Elimination of quantifiers in algebraic structures
• A survey on real structural complexity theory
• Isomorphism theorem for BSS recursively enumerable sets over real closed fields
• 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
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Isomorphism theorem for BSS recursively enumerable sets over real closed fields