13 citations · 70 across the 51 of their papers we have counts for
Showing 2015 · math.LOShow all
3 papers · 2 filters
math.LO2015★ 3 cited
Two series of formalized interpretability principles for weak systems of arithmetic
Evan Goris, Joost J. Joosten
The provability logic of a theory captures the structural behavior of formalized provability in as provable in itself. Like provability, one can formalize the notion of…
math.LO2015★ 6 cited
Turing jumps through provability
Joost J. Joosten
Fixing some computably enumerable theory , the Friedman-Goldfarb-Harrington (FGH) theorem says that over elementary arithmetic, each formula is equivalent to some formula…
math.LO2015★ 1 cited
Predicativity through transfinite reflection
Andrés Cordon Franco, David Fernández Duque, Joost J. Joosten +1
Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of s…