Showing math.LOShow all
2 papers · 1 filter
math.LO2024
Automatic structures and the problem of natural well-orderings
Lev D. Beklemishev, Fedor N. Pakhomov
We explore the idea of using automatic and similar kind of presentations of structures to deal with the conceptual problem of natural proof-theoretic ordinal notations. We conclude…
math.LO2024
On the unification problem for GLP
Lev D. Beklemishev
We show that the polymodal provability logic GLP, in a language with at least two modalities and one variable, has nullary unification type. More specifically, we show that the for…