Pages that link to "Item:Q3795644"

The following pages link to Alfred Tarski's elimination theory for real closed fields (Q3795644):

Displaying 24 items.

• Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
• On approximate and algebraic computability over the real numbers (Q1292404) (← links)
• Complete geometric query languages (Q1307692) (← links)
• Rational Samuelson maps are univalent (Q1318780) (← links)
• P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220) (← links)
• Equilibrium behavior in markets and games: Testable restrictions and identification. (Q1428156) (← links)
• Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912) (← links)
• On the time complexity of partial real functions (Q1977153) (← links)
• On quantified linear implications (Q2254606) (← links)
• Quantifier elimination theory and maps which preserve semipositivity (Q2687228) (← links)
• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets (Q3203015) (← links)
• A Note on Periodicity in Representation Theory of Finite Dimensional Algebras (Q3422795) (← links)
• Undecidable existential theories of polynomial rings and function fields (Q4265563) (← links)
• Extensions of Hilbert's tenth problem (Q4302340) (← links)
• (Q4668856) (← links)
• Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic (Q4706120) (← links)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
• Avoidable algebraic subsets of Euclidean space (Q4955693) (← links)
• On maps which preserve semipositivity and quantifier elimination theory for real numbers (Q5065095) (← links)
• From LP to LP: Programming with constraints (Q5096231) (← links)
• Ascending chains of ideals in the polynomial ring (Q5099835) (← links)
• Model Theory in Algebra, Analysis and Arithmetic: A Preface (Q5256620) (← links)
• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable (Q5288071) (← links)