Lev D. Beklemishev

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 7

Top Topics

Classical Logic

Linearly Ordered

Rewriting Systems

Top Venues

Ann. Pure Appl. Log.

J. Comput. Syst. Sci.

Publications

Lev D. Beklemishev, Fedor Pakhomov
Reflection algebras and conservation results for theories of iterated truth. Ann. Pure Appl. Log. 173 (5) (2022)
Gerald Berger, Lev D. Beklemishev, Hans Tompits
A many-sorted variant of Japaridze's polymodal provability logic. Log. J. IGPL 26 (5) (2018)
Lev D. Beklemishev
A Universal Algebra for the Variable-Free Fragment of $${\mathrm {RC}^\nabla }$$ RC ∇. LFCS (2018)
Lev D. Beklemishev
Guest Editorial: Computer Science Symposium in Russia. Theory Comput. Syst. 61 (2) (2017)
Lev D. Beklemishev
On the Reflection Calculus with Partial Conservativity Operators. WoLLIC (2017)
Uri Abraham, Lev D. Beklemishev, Paola D'Aquino, Marcus Tressl
Preface. Ann. Pure Appl. Log. 167 (10) (2016)
Lev D. Beklemishev, Tommaso Flaminio
Franco Montagna's Work on Provability Logic and Many-valued Logic. Stud Logica 104 (1) (2016)
Lev D. Beklemishev
A note on strictly positive logics and word rewriting systems. CoRR (2015)
Lev D. Beklemishev, Yuri Gurevich
Propositional primal logic with disjunction. J. Log. Comput. 24 (1) (2014)
Lev D. Beklemishev
Positive provability logic for uniform reflection principles. Ann. Pure Appl. Log. 165 (1) (2014)
Lev D. Beklemishev, David Fernández-Duque, Joost J. Joosten
On Provability Logics with Linearly Ordered Modalities. Stud Logica 102 (3) (2014)
Lev D. Beklemishev, Ruy J. G. B. de Queiroz, Andre Scedrov
Editors' foreword. J. Comput. Syst. Sci. 80 (6) (2014)
Lev D. Beklemishev, David Gabelaia
Topological completeness of the provability logic GLP. Ann. Pure Appl. Log. 164 (12) (2013)
Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema
Foreword. Stud Logica 100 (1-2) (2012)
Lev D. Beklemishev
Calibrating Provability Logic: From Modal Logic to Reflection Calculus. Advances in Modal Logic (2012)
Sergei I. Adian, Lev D. Beklemishev, Albert Visser
Proof and Computation. J. Log. Comput. 21 (4) (2011)
Lev D. Beklemishev
Kripke semantics for provability logic GLP. Ann. Pure Appl. Log. 161 (6) (2010)
Lev D. Beklemishev
Ordinal Completeness of Bimodal Provability Logic GLB. TbiLLC (2009)
Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev
Editorial. J. Log. Comput. 15 (4) (2005)
Lev D. Beklemishev, Albert Visser
-consequences of theories. Ann. Pure Appl. Log. 136 (1-2) (2005)
Lev D. Beklemishev, Joost J. Joosten, Marco Vervoort
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. J. Log. Comput. 15 (4) (2005)
Lev D. Beklemishev
Provability algebras and proof-theoretic ordinals, I. Ann. Pure Appl. Log. 128 (1-3) (2004)
Lev D. Beklemishev
On the induction schema for decidable predicates. J. Symb. Log. 68 (1) (2003)
Lev D. Beklemishev
Proof-theoretic analysis by iterated reflection. Arch. Math. Log. 42 (6) (2003)
A. L. Rastsvetaev, Lev D. Beklemishev
On the query complexity of finding a local maximum point. Inf. Process. Lett. 84 (6) (2002)
Lev D. Beklemishev
Open Least Element Principle and Bounded Query Computation. CSL (1999)
Lev D. Beklemishev
Parameter Free Induction and Provably Total Computable Functions. Theor. Comput. Sci. 224 (1-2) (1999)
Lev D. Beklemishev
A proof-theoretic analysis of collection. Arch. Math. Log. 37 (5-6) (1998)
Lev D. Beklemishev
Induction Rules, Reflection Principles, and Provably Recursive Functions. Ann. Pure Appl. Log. 85 (3) (1997)
Lev D. Beklemishev
Parameter Free Induction and Reflection. Kurt Gödel Colloquium (1997)
Lev D. Beklemishev
Bimodal Logics for Extensions of Arithmetical Theories. J. Symb. Log. 61 (1) (1996)
Lev D. Beklemishev
Iterated Local Reflection Versus Iterated Consistency. Ann. Pure Appl. Log. 75 (1-2) (1995)
Lev D. Beklemishev
On Bimodal Logics of Provability. Ann. Pure Appl. Log. 68 (2) (1994)
Sergei N. Artëmov, Lev D. Beklemishev
On propositional quantifiers in provability logic. Notre Dame J. Formal Log. 34 (3) (1993)
Lev D. Beklemishev
On the complexity of arithmetical interpretations of modal formulae. Arch. Math. Log. 32 (3) (1993)
Lev D. Beklemishev
Provability logics for natural turing progressions of arithmetical theories. Stud Logica 50 (1) (1991)