default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLev D. Beklemishev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j30]Lev D. Beklemishev, Fedor Pakhomov:
Reflection algebras and conservation results for theories of iterated truth. Ann. Pure Appl. Log. 173(5): 103093 (2022)
2010 – 2019
- 2019
- [j29]Evgeny Kolmakov, Lev D. Beklemishev:
Axiomatization of Provable n-Provability. J. Symb. Log. 84(2): 849-869 (2019) - 2018
- [j28]Gerald Berger, Lev D. Beklemishev, Hans Tompits:
A many-sorted variant of Japaridze's polymodal provability logic. Log. J. IGPL 26(5): 505-538 (2018) - [c6]Lev D. Beklemishev:
A Universal Algebra for the Variable-Free Fragment of $${\mathrm {RC}^\nabla }$$ RC ∇. LFCS 2018: 91-106 - 2017
- [j27]Lev D. Beklemishev:
Guest Editorial: Computer Science Symposium in Russia. Theory Comput. Syst. 61(2): 462-463 (2017) - [c5]Lev D. Beklemishev:
On the Reflection Calculus with Partial Conservativity Operators. WoLLIC 2017: 48-67 - 2016
- [j26]Uri Abraham, Lev D. Beklemishev
, Paola D'Aquino, Marcus Tressl:
Preface. Ann. Pure Appl. Log. 167(10): 865-867 (2016) - [j25]Lev D. Beklemishev, Tommaso Flaminio:
Franco Montagna's Work on Provability Logic and Many-valued Logic. Stud Logica 104(1): 1-46 (2016) - [e5]Lev D. Beklemishev, Stéphane Demri, András Maté:
Advances in Modal Logic 11, proceedings of the 11th conference on "Advances in Modal Logic," held in Budapest, Hungary, August 30 - September 2, 2016. College Publications 2016, ISBN 978-1-84890-201-5 [contents] - 2015
- [e4]Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, Wolfram Schulte:
Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday. Lecture Notes in Computer Science 9300, Springer 2015, ISBN 978-3-319-23533-2 [contents] - [e3]Lev D. Beklemishev, Daniil V. Musatov:
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings. Lecture Notes in Computer Science 9139, Springer 2015, ISBN 978-3-319-20296-9 [contents] - [i1]Lev D. Beklemishev:
A note on strictly positive logics and word rewriting systems. CoRR abs/1509.00666 (2015) - 2014
- [j24]Lev D. Beklemishev:
Positive provability logic for uniform reflection principles. Ann. Pure Appl. Log. 165(1): 82-105 (2014) - [j23]Lev D. Beklemishev, Ruy J. G. B. de Queiroz, Andre Scedrov:
Editors' foreword. J. Comput. Syst. Sci. 80(6): 1037 (2014) - [j22]Lev D. Beklemishev, Yuri Gurevich:
Propositional primal logic with disjunction. J. Log. Comput. 24(1): 257-282 (2014) - [j21]Lev D. Beklemishev, David Fernández-Duque, Joost J. Joosten:
On Provability Logics with Linearly Ordered Modalities. Stud Logica 102(3): 541-566 (2014) - 2013
- [j20]Lev D. Beklemishev, David Gabelaia:
Topological completeness of the provability logic GLP. Ann. Pure Appl. Log. 164(12): 1201-1223 (2013) - 2012
- [j19]Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema:
Foreword. Stud Logica 100(1-2): 1-7 (2012) - [c4]Lev D. Beklemishev:
Calibrating Provability Logic: From Modal Logic to Reflection Calculus. Advances in Modal Logic 2012: 89-94 - 2011
- [j18]Sergei I. Adian, Lev D. Beklemishev, Albert Visser:
Proof and Computation. J. Log. Comput. 21(4): 541-542 (2011) - [e2]Lev D. Beklemishev, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6642, Springer 2011, ISBN 978-3-642-20919-2 [contents] - 2010
- [j17]Lev D. Beklemishev:
Kripke semantics for provability logic GLP. Ann. Pure Appl. Log. 161(6): 756-774 (2010) - [e1]Lev D. Beklemishev, Valentin Goranko, Valentin B. Shehtman:
Advances in Modal Logic 8, papers from the eighth conference on "Advances in Modal Logic," held in Moscow, Russia, 24-27 August 2010. College Publications 2010, ISBN 978-1-84890-013-4 [contents]
2000 – 2009
- 2009
- [c3]Lev D. Beklemishev:
Ordinal Completeness of Bimodal Provability Logic GLB. TbiLLC 2009: 1-15 - 2005
- [j16]Lev D. Beklemishev, Albert Visser:
On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. Ann. Pure Appl. Log. 136(1-2): 56-74 (2005) - [j15]Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev:
Editorial. J. Log. Comput. 15(4): 409 (2005) - [j14]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): 447-463 (2005) - 2004
- [j13]Lev D. Beklemishev:
Provability algebras and proof-theoretic ordinals, I. Ann. Pure Appl. Log. 128(1-3): 103-123 (2004) - 2003
- [j12]Lev D. Beklemishev:
Proof-theoretic analysis by iterated reflection. Arch. Math. Log. 42(6): 515-552 (2003) - [j11]Lev D. Beklemishev:
On the induction schema for decidable predicates. J. Symb. Log. 68(1): 17-34 (2003) - 2002
- [j10]A. L. Rastsvetaev, Lev D. Beklemishev:
On the query complexity of finding a local maximum point. Inf. Process. Lett. 84(6): 327-332 (2002)
1990 – 1999
- 1999
- [b1]Lev D. Beklemishev, Mati Pentus, Nikolai K. Vereshchagin:
Provability, complexity, grammars. American Mathematical Society translations series 2 192, American Mathematical Society 1999, ISBN 978-0-8218-1078-1, pp. I-VIII, 1-172 - [j9]Lev D. Beklemishev:
Parameter Free Induction and Provably Total Computable Functions. Theor. Comput. Sci. 224(1-2): 13-33 (1999) - [c2]Lev D. Beklemishev:
Open Least Element Principle and Bounded Query Computation. CSL 1999: 389-404 - 1998
- [j8]Lev D. Beklemishev:
A proof-theoretic analysis of collection. Arch. Math. Log. 37(5-6): 275-296 (1998) - 1997
- [j7]Lev D. Beklemishev:
Induction Rules, Reflection Principles, and Provably Recursive Functions. Ann. Pure Appl. Log. 85(3): 193-242 (1997) - [c1]Lev D. Beklemishev:
Parameter Free Induction and Reflection. Kurt Gödel Colloquium 1997: 103-113 - 1996
- [j6]Lev D. Beklemishev:
Bimodal Logics for Extensions of Arithmetical Theories. J. Symb. Log. 61(1): 91-124 (1996) - 1995
- [j5]Lev D. Beklemishev:
Iterated Local Reflection Versus Iterated Consistency. Ann. Pure Appl. Log. 75(1-2): 25-48 (1995) - 1994
- [j4]Lev D. Beklemishev:
On Bimodal Logics of Provability. Ann. Pure Appl. Log. 68(2): 115-159 (1994) - 1993
- [j3]Lev D. Beklemishev:
On the complexity of arithmetical interpretations of modal formulae. Arch. Math. Log. 32(3): 229-238 (1993) - [j2]Sergei N. Artëmov, Lev D. Beklemishev:
On propositional quantifiers in provability logic. Notre Dame J. Formal Log. 34(3): 401-419 (1993) - 1991
- [j1]Lev D. Beklemishev:
Provability logics for natural turing progressions of arithmetical theories. Stud Logica 50(1): 107-128 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
