Arithmetical representations of enumerable sets with a small number of quantifiers

DOI10.1007/BF01084081MaRDI QIDQ1245954zbMATH OpenOpenAlexFDO

Authors Yu. Matiyasevich

Publication date 1976

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01084081

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• Arithmetical problems and recursively enumerable predicates
• Arithmetical representation of recursively enumerable sets
• scientific article; zbMATH DE number 3372034 (Why is no real title available?)
• Some representations of Diophantine sets

Cited in

(2)

• Martin Davis and Hilbert's tenth problem
• Mixed quantifier prefixes over Diophantine equations with integer variables

This page was built for publication: Arithmetical representations of enumerable sets with a small number of quantifiers

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