scientific article; zbMATH DE number 3786758

zbMATH Open0499.03028MaRDI QIDQ3964549FDOQ3964549

Authors:

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

undecidabilityexponential functionsexponential diophantine equationsexponential diophantine representationKalmar elementary set

Mathematics Subject Classification ID

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

Cited In (5)

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

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)