1 citations · 1 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.LO2025
Descending sequences in reflection hierarchies
Mateusz Łełyk, James Walsh
There is no recursively enumerable sequence of sufficiently strong 2-consistent r.e. theories such that each proves the -consistency of the next. Montalbán and Shavrukov indepen…
math.LO2025
Ranking theories via encoded -models
Hanul Jeon, Patrick Lutz, Fedor Pakhomov +1
Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories…