Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- 3 September 2004
- journal article
- Published by Elsevier BV in Mathematics and Computers in Simulation
- Vol. 67 (1-2), 125-133
- https://doi.org/10.1016/j.matcom.2004.05.013
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Decision problems for differential equationsThe Journal of Symbolic Logic, 1989
- Power series solutions of algebraic differential equationsMathematische Annalen, 1984
- Universal diophantine equationThe Journal of Symbolic Logic, 1982
- Diophantine complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- On Canonical Forms and SimplificationJournal of the ACM, 1970
- Some recursively unsolvable problems in analysisProceedings of the American Mathematical Society, 1969
- The Decision Problem for Exponential Diophantine EquationsAnnals of Mathematics, 1961
- Arithmetical problems and recursively enumerable predicatesThe Journal of Symbolic Logic, 1953
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931
- NotesNature, 1901