Search the dblp DataBase

Publications of Author

1. Lev D. Beklemishev
   Open Least Element Principle and Bounded Query Computation. [Citation Graph (0, 0)][DBLP]
   CSL, 1999, pp:389-404 [Conf]
   
2. Lev D. Beklemishev
   Parameter Free Induction and Reflection. [Citation Graph (0, 0)][DBLP]
   Kurt Gödel Colloquium, 1997, pp:103-113 [Conf]
   
3. Lev D. Beklemishev
   Proof-theoretic analysis by iterated reflection. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2003, v:42, n:6, pp:515-552 [Journal]
   
4. Lev D. Beklemishev
   Provability algebras and proof-theoretic ordinals, I. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2004, v:128, n:1-3, pp:103-123 [Journal]
   
5. Lev D. Beklemishev
   On Bimodal Logics of Provability. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1994, v:68, n:2, pp:115-159 [Journal]
   
6. Lev D. Beklemishev
   Iterated Local Reflection Versus Iterated Consistency. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:25-48 [Journal]
   
7. Lev D. Beklemishev
   Induction Rules, Reflection Principles, and Provably Recursive Functions. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1997, v:85, n:3, pp:193-242 [Journal]
   
8. Lev D. Beklemishev, Albert Visser
   On the limit existence principles in elementary arithmetic and Sigma _n ⁰-consequences of theories. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:56-74 [Journal]
   
9. A. L. Rastsvetaev, Lev D. Beklemishev
   On the query complexity of finding a local maximum point. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:327-332 [Journal]
   
10. Lev D. Beklemishev
    On the induction schema for decidable predicates. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:1, pp:17-34 [Journal]
    
11. Lev D. Beklemishev
    Bimodal Logics for Extensions of Arithmetical Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:1, pp:91-124 [Journal]
    
12. Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:4, pp:409- [Journal]
    
13. Lev D. Beklemishev, Joost J. Joosten, Marco Vervoort
    A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:4, pp:447-463 [Journal]
    
14. Lev D. Beklemishev
    Parameter Free Induction and Provably Total Computable Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:13-33 [Journal]
    
15. 
    A proof-theoretic analysis of collection. [Citation Graph (, )][DBLP]
    
    
16. 
    Kripke semantics for provability logic GLP. [Citation Graph (, )][DBLP]