Lev D. Beklemishev

	2012
22		Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema: Foreword. Studia Logica 100(1-2): 1-7 (2012)
	2011
21		Lev D. Beklemishev, Ruy de Queiroz: Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings Springer 2011
20		Sergei I. Adian, Lev D. Beklemishev, Albert Visser: Proof and Computation. J. Log. Comput. 21(4): 541-542 (2011)
	2010
19		Lev D. Beklemishev: Kripke semantics for provability logic GLP. Ann. Pure Appl. Logic 161(6): 756-774 (2010)
	2009
18		Lev D. Beklemishev: Ordinal Completeness of Bimodal Provability Logic GLB. TbiLLC 2009: 1-15
	2008
17		Lev D. Beklemishev, Valentin Goranko, Valentin 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 2008
	2005
16		Lev D. Beklemishev, Albert Visser: On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. Ann. Pure Appl. Logic 136(1-2): 56-74 (2005)
15		Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev: Editorial. J. Log. Comput. 15(4): 409 (2005)
14		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
13		Lev D. Beklemishev: Provability algebras and proof-theoretic ordinals, I. Ann. Pure Appl. Logic 128(1-3): 103-123 (2004)
	2003
12		Lev D. Beklemishev: Proof-theoretic analysis by iterated reflection. Arch. Math. Log. 42(6): 515-552 (2003)
11		Lev D. Beklemishev: On the induction schema for decidable predicates. J. Symb. Log. 68(1): 17-34 (2003)
	2002
10		A. L. Rastsvetaev, Lev D. Beklemishev: On the query complexity of finding a local maximum point. Inf. Process. Lett. 84(6): 327-332 (2002)
	1999
9		Lev D. Beklemishev: Open Least Element Principle and Bounded Query Computation. CSL 1999: 389-404
8		Lev D. Beklemishev: Parameter Free Induction and Provably Total Computable Functions. Theor. Comput. Sci. 224(1-2): 13-33 (1999)
	1998
7		Lev D. Beklemishev: A proof-theoretic analysis of collection. Arch. Math. Log. 37(5-6): 275-296 (1998)
	1997
6		Lev D. Beklemishev: Parameter Free Induction and Reflection. Kurt Gödel Colloquium 1997: 103-113
5		Lev D. Beklemishev: Induction Rules, Reflection Principles, and Provably Recursive Functions. Ann. Pure Appl. Logic 85(3): 193-242 (1997)
	1996
4		Lev D. Beklemishev: Bimodal Logics for Extensions of Arithmetical Theories. J. Symb. Log. 61(1): 91-124 (1996)
	1995
3		Lev D. Beklemishev: Iterated Local Reflection Versus Iterated Consistency. Ann. Pure Appl. Logic 75(1-2): 25-48 (1995)
	1994
2		Lev D. Beklemishev: On Bimodal Logics of Provability. Ann. Pure Appl. Logic 68(2): 115-159 (1994)
	1993
1		Sergei N. Artëmov, Lev D. Beklemishev: On propositional quantifiers in provability logic. Notre Dame Journal of Formal Logic 34(3): 401-419 (1993)

Coauthor Index

1	Sergei I. Adian	[15] [20]
2	Sergei N. Artëmov	[1]
3	Matthias Baaz	[15]
4	Guram Bezhanishvili	[22]
5	Valentin Goranko	[17]
6	Joost J. Joosten	[14]
7	Daniele Mundici	[22]
8	Ruy de Queiroz	[21]
9	A. L. Rastsvetaev	[10]
10	Valentin Shehtman	[17]
11	Yde Venema	[22]
12	Marco Vervoort	[14]
13	Albert Visser	[16] [20]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page