Lev D. Beklemishev

Orcid: 0000-0002-2949-0600

According to our database¹, Lev D. Beklemishev authored at least 38 papers between 1991 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2022

Reflection algebras and conservation results for theories of iterated truth.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Fedor Pakhomov

Ann. Pure Appl. Log., 2022

2019

Axiomatization of Provable n-Provability.

[BibT_eX]

[DOI]

Evgeny Kolmakov

Lev D. Beklemishev

J. Symb. Log., 2019

2018

A many-sorted variant of Japaridze's polymodal provability logic.

[BibT_eX]

[DOI]

Gerald Berger

Lev D. Beklemishev

Hans Tompits

Log. J. IGPL, 2018

A Universal Algebra for the Variable-Free Fragment of $${\mathrm {RC}^\nabla }$$ RC ∇.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017

Guest Editorial: Computer Science Symposium in Russia.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Theory Comput. Syst., 2017

On the Reflection Calculus with Partial Conservativity Operators.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Logic, Language, Information, and Computation, 2017

2016

Franco Montagna's Work on Provability Logic and Many-valued Logic.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Tommaso Flaminio

Stud Logica, 2016

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2015

A note on strictly positive logics and word rewriting systems.

[BibT_eX]

[DOI]

Lev D. Beklemishev

CoRR, 2015

2014

On Provability Logics with Linearly Ordered Modalities.

[BibT_eX]

[DOI]

Lev D. Beklemishev

David Fernández-Duque

Joost J. Joosten

Stud Logica, 2014

Propositional primal logic with disjunction.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Yuri Gurevich

J. Log. Comput., 2014

Editors' foreword.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ruy J. G. B. de Queiroz

Andre Scedrov

J. Comput. Syst. Sci., 2014

Positive provability logic for uniform reflection principles.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 2014

2013

Topological completeness of the provability logic GLP.

[BibT_eX]

[DOI]

Lev D. Beklemishev

David Gabelaia

Ann. Pure Appl. Log., 2013

2012

Foreword.

[BibT_eX]

[DOI]

Stud Logica, 2012

Calibrating Provability Logic: From Modal Logic to Reflection Calculus.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Advances in Modal Logic 9, 2012

2011

Proof and Computation.

[BibT_eX]

[DOI]

Sergei I. Adian

Lev D. Beklemishev

Albert Visser

J. Log. Comput., 2011

2010

Kripke semantics for provability logic GLP.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 2010

2009

Ordinal Completeness of Bimodal Provability Logic GLB.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Logic, Language, and Computation, 2009

2005

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Joost J. Joosten

Marco Vervoort

J. Log. Comput., 2005

Editorial.

[BibT_eX]

[DOI]

Sergei I. Adian

Matthias Baaz

Lev D. Beklemishev

J. Log. Comput., 2005

On the limit existence principles in elementary arithmetic and Sigma <sub>n</sub> <sup>0</sup>-consequences of theories.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Albert Visser

Ann. Pure Appl. Log., 2005

2004

Provability algebras and proof-theoretic ordinals, I.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 2004

2003

On the induction schema for decidable predicates.

[BibT_eX]

[DOI]

Lev D. Beklemishev

J. Symb. Log., 2003

Proof-theoretic analysis by iterated reflection.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Arch. Math. Log., 2003

2002

On the query complexity of finding a local maximum point.

[BibT_eX]

[DOI]

A. L. Rastsvetaev

Lev D. Beklemishev

Inf. Process. Lett., 2002

1999

Parameter Free Induction and Provably Total Computable Functions.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Theor. Comput. Sci., 1999

Open Least Element Principle and Bounded Query Computation.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

Provability, complexity, grammars.

[BibT_eX]

Lev D. Beklemishev

Mati Pentus

Nikolai K. Vereshchagin

American Mathematical Society translations series 2 192, American Mathematical Society, ISBN: 978-0-8218-1078-1, 1999

1998

A proof-theoretic analysis of collection.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Arch. Math. Log., 1998

1997

Induction Rules, Reflection Principles, and Provably Recursive Functions.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 1997

Parameter Free Induction and Reflection.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1996

Bimodal Logics for Extensions of Arithmetical Theories.

[BibT_eX]

[DOI]

Lev D. Beklemishev

J. Symb. Log., 1996

1995

Iterated Local Reflection Versus Iterated Consistency.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 1995

1994

On Bimodal Logics of Provability.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Ann. Pure Appl. Log., 1994

1993

On propositional quantifiers in provability logic.

[BibT_eX]

[DOI]

Sergei N. Artëmov

Lev D. Beklemishev

Notre Dame J. Formal Log., 1993

On the complexity of arithmetical interpretations of modal formulae.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Arch. Math. Log., 1993

1991

Provability logics for natural turing progressions of arithmetical theories.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Stud Logica, 1991

Lev D. Beklemishev

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...