Incompleteness theorem for computable problems

DOI10.1007/S10559-024-00707-1MaRDI QIDQ6638457zbMATH OpenFDO

Authors Anatol M. Gupal, O. A. Vagis

Publication date 14 November 2024

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

Full work available at URL https://doi.org/10.1007/S10559-024-00707-1

zbMATH Keywords

diagonal methodDiophantine setrecursively enumerable sets

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• Incompleteness of arithmetic from the viewpoint of Diophantine set theory

Cited in

(1)

• An internal entropy indicator for the controllability of complex system evolution

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)