Provability logics for natural turing progressions of arithmetical theories. - Lev D. Beklemishev (Stud Logica, 1991)

On the complexity of arithmetical interpretations of modal formulae. - Lev D. Beklemishev (Arch. Math. Log., 1993)

On propositional quantifiers in provability logic. - Sergei N. Artëmov; Lev D. Beklemishev (Notre Dame J. Formal Log., 1993)

On Bimodal Logics of Provability. - Lev D. Beklemishev (Ann. Pure Appl. Log., 1994)

Iterated Local Reflection Versus Iterated Consistency. - Lev D. Beklemishev (Ann. Pure Appl. Log., 1995)

Bimodal Logics for Extensions of Arithmetical Theories. - Lev D. Beklemishev (J. Symb. Log., 1996)

Parameter Free Induction and Reflection. - Lev D. Beklemishev (Kurt Gödel Colloquium, 1997)

Induction Rules, Reflection Principles, and Provably Recursive Functions. - Lev D. Beklemishev (Ann. Pure Appl. Log., 1997)

A proof-theoretic analysis of collection. - Lev D. Beklemishev (Arch. Math. Log., 1998)

Provability, complexity, grammars. - Lev D. Beklemishev; Mati Pentus; Nikolai K. Vereshchagin (American Mathematical Society, 1999)

Open Least Element Principle and Bounded Query Computation. - Lev D. Beklemishev (CSL, 1999)

Parameter Free Induction and Provably Total Computable Functions. - Lev D. Beklemishev (Theor. Comput. Sci., 1999)

On the query complexity of finding a local maximum point. - A. L. Rastsvetaev; Lev D. Beklemishev (Inf. Process. Lett., 2002)

Proof-theoretic analysis by iterated reflection. - Lev D. Beklemishev (Arch. Math. Log., 2003)

On the induction schema for decidable predicates. - Lev D. Beklemishev (J. Symb. Log., 2003)

Provability algebras and proof-theoretic ordinals, I. - Lev D. Beklemishev (Ann. Pure Appl. Log., 2004)

On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. - Lev D. Beklemishev; Albert Visser (Ann. Pure Appl. Log., 2005)

Editorial. - Sergei I. Adian; Matthias Baaz; Lev D. Beklemishev (J. Log. Comput., 2005)

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. - Lev D. Beklemishev; Joost J. Joosten; Marco Vervoort (J. Log. Comput., 2005)

Ordinal Completeness of Bimodal Provability Logic GLB. - Lev D. Beklemishev (TbiLLC, 2009)

Kripke semantics for provability logic GLP. - Lev D. Beklemishev (Ann. Pure Appl. Log., 2010)

Proof and Computation. - Sergei I. Adian; Lev D. Beklemishev; Albert Visser (J. Log. Comput., 2011)

Calibrating Provability Logic: From Modal Logic to Reflection Calculus. - Lev D. Beklemishev (Advances in Modal Logic, 2012)

Foreword. - Lev D. Beklemishev; Guram Bezhanishvili; Daniele Mundici; Yde Venema (Stud Logica, 2012)

Topological completeness of the provability logic GLP. - Lev D. Beklemishev; David Gabelaia (Ann. Pure Appl. Log., 2013)

Positive provability logic for uniform reflection principles. - Lev D. Beklemishev (Ann. Pure Appl. Log., 2014)

Editors' foreword. - Lev D. Beklemishev; Ruy J. G. B. de Queiroz; Andre Scedrov (J. Comput. Syst. Sci., 2014)

Propositional primal logic with disjunction. - Lev D. Beklemishev; Yuri Gurevich (J. Log. Comput., 2014)

On Provability Logics with Linearly Ordered Modalities. - Lev D. Beklemishev; David Fernández-Duque; Joost J. Joosten (Stud Logica, 2014)

A note on strictly positive logics and word rewriting systems. - Lev D. Beklemishev (CoRR, 2015)

Preface. - Uri Abraham; Lev D. Beklemishev; Paola D'Aquino; Marcus Tressl (Ann. Pure Appl. Log., 2016)

Franco Montagna's Work on Provability Logic and Many-valued Logic. - Lev D. Beklemishev; Tommaso Flaminio (Stud Logica, 2016)

On the Reflection Calculus with Partial Conservativity Operators. - Lev D. Beklemishev (WoLLIC, 2017)

Guest Editorial: Computer Science Symposium in Russia. - Lev D. Beklemishev (Theory Comput. Syst., 2017)

A Universal Algebra for the Variable-Free Fragment of $${ mathrm {RC}^ nabla }$$ RC ∇. - Lev D. Beklemishev (LFCS, 2018)

A many-sorted variant of Japaridze's polymodal provability logic. - Gerald Berger; Lev D. Beklemishev; Hans Tompits (Log. J. IGPL, 2018)

Axiomatization of Provable n-Provability. - Evgeny Kolmakov; Lev D. Beklemishev (J. Symb. Log., 2019)

Reflection algebras and conservation results for theories of iterated truth. - Lev D. Beklemishev; Fedor Pakhomov (Ann. Pure Appl. Log., 2022)