General notions of consistency
From MaRDI portal
Cites work
- Another look at the second incompleteness theorem
- Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
- Arithmetization of metamathematics in a general setting
- Can we make the second incompleteness theorem coordinate free?
- Friedman-reflexivity
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- Gödel-Rosser's incompleteness theorem, generalized and optimized for definable theories
- Handbook of proof theory
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 218514 (Why is no real title available?)
- Induction rules, reflection principles, and provably recursive functions
- Interpretability suprema in Peano arithmetic
- Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
- Provability logics relative to a fixed extension of Peano arithmetic
- Reflection principles and provability algebras in formal arithmetic
- Slow consistency
- The second incompleteness theorem and bounded interpretations
This page was built for publication: General notions of consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938598)