Incompleteness theorem for computable problems

DOI10.1007/S10559-024-00707-1MaRDI QIDQ6638457FDOQ6638457

Authors: Anatol M. Gupal, O. A. Vagis 

Publication date: 14 November 2024

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

recursively enumerable setsdiagonal methodDiophantine set

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) General logic (03Bxx) Mathematical logic and foundations (03-XX)

Cites Work

• Title not available (Why is that?)
• Incompleteness of arithmetic from the viewpoint of Diophantine set theory

This page was built for publication: Incompleteness theorem for computable problems

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