Hyperarithmetical worm battles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5057388 (Why is no real title available?)
- Axiomatic theories of truth
- Induction rules, reflection principles, and provably recursive functions
- Models of transfinite provability logic
- MÜNCHHAUSEN PROVABILITY
- On provability logics with linearly ordered modalities
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- Provability algebras and proof-theoretic ordinals. I
- Reflection algebras and conservation results for theories of iterated truth
- Reflection principles and provability algebras in formal arithmetic
- The omega-rule interpretation of transfinite provability logic
- The optimality of induction as an axiomatization of arithmetic
- The polytopologies of transfinite provability logic
- Truth, disjunction, and induction
- Turing-Taylor expansions for arithmetic theories
- Well-orders in the transfinite Japaridze algebra
This page was built for publication: Hyperarithmetical worm battles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151396)