Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912): Difference between revisions

@@ Property / cites work @@
+Q3770650
@@ Property / cites work: Q3770650 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+Alfred Tarski's elimination theory for real closed fields
+Normal rank
@@ Property / cites work @@
+Elimination of quantifiers in algebraic structures
+Normal rank
@@ Property / cites work @@
+A survey on real structural complexity theory
@@ Property / cites work: A survey on real structural complexity theory / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism theorem for BSS recursively enumerable sets over real closed fields
+Normal rank
@@ Property / cites work @@
+Q4841154
@@ Property / cites work: Q4841154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5656753
@@ Property / cites work: Q5656753 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5807665
@@ Property / cites work: Q5807665 / rank @@
+Normal rank
@@ Property / cites work @@
+Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
+Normal rank