Aspects of incompleteness
This is a very good, updated treatment of incompleteness. It is fairly self-contained but it is not a textbook for beginners; yet, readers acquainted with introductory presentations of the subject will find the work rewarding. It begins with a review of Gödel's now classical approach to the incompleteness of arithmetic, but quickly moves into more recent developments and generalizations, including theorems due to the author. Chapters five, six, and seven on Partial Conservativity, Interpretability, and Degrees of Interpretability are without question the most interesting: clearly written, and containing some material not found outside journals. The exercises are excellent, though many not easy.
- scientific article; zbMATH DE number 2014521
- scientific article; zbMATH DE number 15306
- scientific article; zbMATH DE number 1339027
- Incompleteness in a General Setting
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- In search of the sources of incompleteness
- Incompleteness and paradox
- Incompleteness and fixed points
- Inconsistency and Incompleteness, Revisited
- Incompleteness in the finite domain
- Incompleteness and the Barcan formula
- The implicit commitment of arithmetical theories and its semantic core
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Slow reflection
- Incompleteness and fixed points
- Illusory models of Peano arithmetic
- A theorem on partial conservativity in arithmetic
- On Relating Theories: Proof-Theoretical Reduction
- Inconsistency and Incompleteness, Revisited
- On predicate provability logics and binumerations of fragments of Peano arithmetic
- scientific article; zbMATH DE number 15306 (Why is no real title available?)
- Streamlined subrecursive degree theory
- Weak theories of concatenation and arithmetic
- scientific article; zbMATH DE number 2014521 (Why is no real title available?)
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- Hilbert, duality, and the geometrical roots of model theory
- Yablifying the Rosser sentence
- Rosser-type undecidable sentences based on Yablo's paradox
- Current research on Gödel's incompleteness theorems
- Finding the limit of incompleteness. I
- THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
- Reflection ranks and ordinal analysis
- VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
- A mathematical commitment without computational strength
- How much propositional logic suffices for Rosser's essential undecidability theorem?
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Incompleteness Ex Machina
- Marginalia on a theorem of Woodin
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
- TWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVE
- Indiscernibles and satisfaction classes in arithmetic
- An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
- On Gödel's ‘Much Weaker’ Assumption
- Is the HYPE about strength warranted?
- Faith \& falsity
- Another look at reflection
- Henkin sentences and local reflection principles for Rosser provability
This page was built for publication: Aspects of incompleteness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354788)
