Generic Gödel's incompleteness theorem

DOI10.1007/S10469-017-9442-9MaRDI QIDQ683374zbMATH OpenOpenAlexFDO

Authors Alexander Rybalov

Publication date 6 February 2018

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-017-9442-9

zbMATH Keywords

formal arithmeticgeneric subsets of arithmetic statementsGödel's theorem

Mathematics Subject Classification ID

Gödel numberings and issues of incompleteness (03F40)

Recommendations

• Generic incompleteness of formal arithmetic
• Is complexity a source of incompleteness?
• Gödel incompleteness theorems and the limits of their applicability. I
• On Godel's Second Incompleteness Theorem
• There may be many arithmetical Gödel sentences

Cites work

• Generic incompleteness of formal arithmetic
• Generic-case complexity, decision problems in group theory, and random walks.

Cited in

(4)

• Finding the limit of incompleteness. I
• Concrete mathematical incompleteness: basic emulation theory
• Generic incompleteness of formal arithmetic
• Partially generic formulas in arithmetic

This page was built for publication: Generic Gödel's incompleteness theorem

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