Generic incompleteness of formal arithmetic

DOI10.17377/SEMI.2015.12.015MaRDI QIDQ2630551zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 28 July 2016

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17377/SEMI.2015.12.015

zbMATH Keywords

formal arithmeticgeneric complexity

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Gödel numberings and issues of incompleteness (03F40)

Recommendations

• Generic Gödel's incompleteness theorem
• Gödel incompleteness theorems and the limits of their applicability. I
• Is complexity a source of incompleteness?
• On Godel's Second Incompleteness Theorem
• scientific article; zbMATH DE number 1339027

Cited in

(10)

• Partially generic formulas in arithmetic
• Is independence an exception?
• Generic Kleene fixed point theorem
• Any statement can be generalized so that it becomes trivial: a simple formalization of D. K. Faddeev's belief
• scientific article; zbMATH DE number 4006256 (Why is no real title available?)
• scientific article; zbMATH DE number 1339027 (Why is no real title available?)
• There may be many arithmetical Gödel sentences
• Theorem Proving in Higher Order Logics
• INCOMPATIBILITY OF GENERIC HUGENESS PRINCIPLES
• Generic Gödel's incompleteness theorem

This page was built for publication: Generic incompleteness of formal arithmetic

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