scientific article; zbMATH DE number 3372034

MaRDI QIDQ5643974zbMATH OpenFDO

Authors Yu. Matiyasevich

Publication date 1971

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Cited in

(10)

• On the application of Skolem's p-adic method to the solution of Thue equations
• A new proof of the theorem on exponential diophantine representation of enumerable sets
• Hilbert's tenth problem
• Arithmetical representations of enumerable sets with a small number of quantifiers
• Theory of proofs (arithmetic and analysis)
• Diophantine representations of linear recurrences. I
• Complete sets of unifiers and matchers in equational theories
• On a Diophantine representation of the predicate of provability
• On polynomial-modular recursive sequences
• A new probabilistic constraint logic programming language based on a generalised distribution semantics

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 Q5643974)