L. Beklemishev

activity

20112025

most citedReflection calculus and conservativity spectra

7 citations · 19 across the 17 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.LO2018★ 5 cited

Axiomatizing provable $n$ -provability

Evgeny Kolmakov, Lev Beklemishev

A formula $ϕ$ is called \emph{ $n$ -provable} in a formal arithmetical theory $S$ if $ϕ$ is provable in $S$ together with all true arithmetical $Π_{n}$ -sentences taken as additional…

math.LO2018

A universal Kripke frame for the variable-free fragment of RC $^{\nabla}$

Lev D. Beklemishev

This note characterizes a universal Kripke frame for the variable-free fragment of the reflection calculus with conservativity operators RC $^{\nabla}$ . The frame here is obtained fro…

Axiomatizing provable n-provability

A universal Kripke frame for the variable-free fragment of RC∇

Axiomatizing provable $n$ -provability

A universal Kripke frame for the variable-free fragment of RC $^{\nabla}$