ANEW RELATION‐COMBINING THEOREM AND ITS APPLICATION

DOI10.1002/MALQ.19920380117zbMATH Open0793.03004OpenAlexW2159229515MaRDI QIDQ4295232FDOQ4295232

Zhi-Wei Sun

Publication date: 21 August 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380117

Recommendations

• A logical approach to the problem of representation of integers by systems of diagonal forms
• Reduction of unknowns in diophantine representations
• An unsolvable problem in number theory
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Computational complexities of diophantine equations with parameters

zbMATH Keywords

decidabilityundecidabilityDiophantine representationHilbert's tenth problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Diophantine equations (11D99) Undecidability and degrees of sets of sentences (03D35) Decidability (number-theoretic aspects) (11U05)

Cited In (4)

• Further results on Hilbert's tenth problem
• Recursively enumerable sets of polynomials over a finite field are Diophantine
• What can and cannot be done with Diophantine problems
• Title not available (Why is that?)

This page was built for publication: ANEW RELATION‐COMBINING THEOREM AND ITS APPLICATION

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