scientific article; zbMATH DE number 3786758

MaRDI QIDQ3964549zbMATH OpenFDO

Authors

Publication date 1982

zbMATH Keywords

exponential diophantine equationsexponential diophantine representationexponential functionsKalmar elementary setundecidability

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35) Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05)

Cited in

(5)

• A direct method for simulating partial recursive functions by Diophantine equations
• Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
• Diophantine representation of the decimal expansions of e and
• Martin Davis and Hilbert's tenth problem
• Towards finite-fold Diophantine representations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964549)