scientific article; zbMATH DE number 503387

zbMath0793.03066MaRDI QIDQ4279726

Lenore Blum, Stephen Smale

Publication date: 22 February 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computabilityGödel incompleteness theoremreal closed fieldTarski's theoremdecidability over a ringdefinable set over the realsdefinable undecidable set over \(\mathbb{Z}\)infinite ordered field

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items (6)

Undecidability of the Spectral Gap ⋮ The Turing degrees for some computation model with the real parameter ⋮ 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 ⋮ Ordered Rings Over Which Output Sets are Recursively Enumerable Sets ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Mathematical problems for the next century

This page was built for publication: