|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema |
Foreword.  |
Studia Logica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei I. Adian, Lev D. Beklemishev, Albert Visser |
Proof and Computation. |
J. Log. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev, Ruy de Queiroz (eds.) |
Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings |
WoLLIC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Kripke semantics for provability logic GLP. |
Ann. Pure Appl. Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Ordinal Completeness of Bimodal Provability Logic GLB. |
TbiLLC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev, Valentin Goranko, Valentin Shehtman (eds.) |
Advances in Modal Logic 8, papers from the eighth conference on "Advances in Modal Logic," held in Moscow, Russia, 24-27 August 2010 |
Advances in Modal Logic |
2008 |
DBLP BibTeX RDF |
|
| 1 | Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev |
Editorial. |
J. Log. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev, Joost J. Joosten, Marco Vervoort |
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. |
J. Log. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev, Albert Visser |
On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. |
Ann. Pure Appl. Logic |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Provability algebras and proof-theoretic ordinals, I. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
On the induction schema for decidable predicates. |
J. Symb. Log. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Proof-theoretic analysis by iterated reflection. |
Arch. Math. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | A. L. Rastsvetaev, Lev D. Beklemishev |
On the query complexity of finding a local maximum point. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Parameter Free Induction and Provably Total Computable Functions. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Open Least Element Principle and Bounded Query Computation. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
A proof-theoretic analysis of collection. |
Arch. Math. Log. |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): Primary: 03F30, Secondary: 03F05, 03D20 |
| 1 | Lev D. Beklemishev |
Induction Rules, Reflection Principles, and Provably Recursive Functions. |
Ann. Pure Appl. Logic |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Parameter Free Induction and Reflection. |
Kurt Gödel Colloquium |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Bimodal Logics for Extensions of Arithmetical Theories. |
J. Symb. Log. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
Iterated Local Reflection Versus Iterated Consistency. |
Ann. Pure Appl. Logic |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lev D. Beklemishev |
On Bimodal Logics of Provability. |
Ann. Pure Appl. Logic |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei N. Artëmov, Lev D. Beklemishev |
On propositional quantifiers in provability logic. |
Notre Dame Journal of Formal Logic |
1993 |
DBLP BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")