Hyperarithmetical worm battles
From MaRDI portal
Publication:2151396
DOI10.1007/978-3-030-93100-1_5OpenAlexW4200573286MaRDI QIDQ2151396
David Fernández-Duque, Joost J. Joosten, Konstnatinos Papafilippou
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2112.07473
Cites Work
- Unnamed Item
- Unnamed Item
- On provability logics with linearly ordered modalities
- Turing-Taylor expansions for arithmetic theories
- Induction rules, reflection principles, and provably recursive functions
- The omega-rule interpretation of transfinite provability logic
- Provability algebras and proof-theoretic ordinals. I
- Reflection algebras and conservation results for theories of iterated truth
- Truth, disjunction, and induction
- The polytopologies of transfinite provability logic
- Reflection principles and provability algebras in formal arithmetic
- The optimality of induction as an axiomatization of arithmetic
- Well-orders in the transfinite Japaridze algebra
- MÜNCHHAUSEN PROVABILITY
- Models of transfinite provability logic
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
This page was built for publication: Hyperarithmetical worm battles
