scientific article
From MaRDI portal
Publication:3964549
zbMath0499.03028MaRDI QIDQ3964549
No author found.
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilityexponential functionsexponential diophantine equationsexponential diophantine representationKalmar elementary set
Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05) Undecidability and degrees of sets of sentences (03D35) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (5)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ Towards finite-fold Diophantine representations ⋮ Unnamed Item ⋮ Martin Davis and Hilbert’s Tenth Problem
This page was built for publication:
