The worm principle

MaRDI QIDQ5494229zbMATH OpenFDO

Authors Lev D. Beklemishev

Publication date 17 October 2006

zbMATH Keywords

graded provability algebraHydra battleindependencePeano arithmetic

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• Worms, gaps, and hydras
• On some slowly terminating term rewriting systems
• A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem.
• A direct independence proof of Buchholz's Hydra Game on finite labeled trees
• scientific article; zbMATH DE number 4031661

Cited in

(18)

• Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
• Hyperarithmetical worm battles
• On the positive fragment of the polymodal provability logic GLP
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• The Henkin sentence
• On provability logics with linearly ordered modalities
• Current research on Gödel's incompleteness theorems
• scientific article; zbMATH DE number 7577570 (Why is no real title available?)
• Another look at the second incompleteness theorem
• The Worm Calculus
• Topological interpretations of provability logic
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION
• Reflection calculus and conservativity spectra
• Worms, gaps, and hydras
• Arithmetical and Hyperarithmetical Worm Battles
• AN ESCAPE FROM VARDANYAN’S THEOREM
• Chair of Mathematical Logic and Theory of Algorithms
• Transductions in arithmetic

This page was built for publication: The worm principle

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