Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications

DOI10.1002/cplx.6130010312zbMath0840.03030OpenAlexW1993549872MaRDI QIDQ1904898

Francisco Antonio Doria, Newton C. A. Da Costa

Publication date: 1 July 1996

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cplx.6130010312

zbMATH Keywords

surveyundecidabilityincompleteness

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Undecidability, incompleteness and Arnol'd problems ⋮ The incompleteness of theories of games

This page was built for publication: Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications