Decidability in elementary analysis. I

DOI10.1016/0001-8708(89)90044-3zbMath0681.03005OpenAlexW4210674105MaRDI QIDQ1823233

Harvey M. Friedman, Seress, Ákos

Publication date: 1989

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(89)90044-3

zbMATH Keywords

PSPACE procedures

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Decidability in elementary analysis. II ⋮ A decidable theory involving addition of differentiable real functions ⋮ Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates

Cites Work

• Unnamed Item
• The decision problem for linear temporal logic
• Existential interpretation. II

This page was built for publication: Decidability in elementary analysis. I