31 found
Sort by:
  1. Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten (forthcoming). On Provability Logics with Linearly Ordered Modalities. Studia Logica:1-26.
    We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Lev Beklemishev (2014). Positive Provability Logic for Uniform Reflection Principles. Annals of Pure and Applied Logic 165 (1):82-105.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Lev Beklemishev & David Gabelaia (2013). Topological Completeness of the Provability Logic GLP. Annals of Pure and Applied Logic 164 (12):1201-1223.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Lev Beklemishev, Guram Bezhanishvili, Daniele Mundici & Yde Venema (2012). Foreword. Studia Logica 100 (1-2):1-7.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Lev Beklemishev, Ruy de Queiroz & Andre Scedrov (2012). 18th Workshop on Logic, Language, Information and Computation (Wollic 2011). Bulletin of Symbolic Logic 18 (1).
     
    My bibliography  
     
    Export citation  
  6. Georges Gonthier, Martin Ziegler, Steve Awodey, George Barmpalias & Lev D. Beklemishev (2012). Barcelona, Catalonia, Spain July 11–16, 2011. Bulletin of Symbolic Logic 18 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Lev D. Beklemishev (2010). Kripke Semantics for Provability Logic GLP. Annals of Pure and Applied Logic 161 (6):756-774.
    A well-known polymodal provability logic inlMMLBox due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of inlMMLBox is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for inlMMLBox . First, we isolate a certain subsystem inlMMLBox (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. Lev Beklemishev, Valentin Goranko & Valentin B. Shehtman (eds.) (2010). Advances in Modal Logic 8. College Publications.
    No categories
     
    My bibliography  
     
    Export citation  
  9. John Baldwin, Lev Beklemishev, Anuj Dawar, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux & Grigori Mints (2008). Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW] Bulletin of Symbolic Logic 14 (1).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. T. Franzen & Lev D. Beklemishev (2008). REVIEWS-Inexhaustibility: A Non-Exhaustive Treatment and a Survey on Transfinite Progressions. Bulletin of Symbolic Logic 14 (2).
     
    My bibliography  
     
    Export citation  
  11. I. Franzen & Lev D. Beklemishev (2007). REVIEWS-Godel's Theorem: An Incomplete Guide to its Use and Abuse. Bulletin of Symbolic Logic 13 (2):241.
     
    My bibliography  
     
    Export citation  
  12. John Baldwin, Lev Beklemishev, Michael Hallett, Valentina Harizanov, Steve Jackson, Kenneth Kunen, Angus J. MacIntyre, Penelope Maddy, Joe Miller & Michael Rathjen (2005). Carnegie Mellon University, Pittsburgh, PA May 19–23, 2004. Bulletin of Symbolic Logic 11 (1).
    Direct download  
     
    My bibliography  
     
    Export citation  
  13. Lev D. Beklemishev & Albert Visser (2005). On the Limit Existence Principles in Elementary Arithmetic and -Consequences of Theories. Annals of Pure and Applied Logic 136 (1-2):56-74.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. Lev D. Beklemishev (2004). Provability Algebras and Proof-Theoretic Ordinals, I. Annals of Pure and Applied Logic 128 (1-3):103-123.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Lev D. Beklemishev (2003). On the Induction Schema for Decidable Predicates. Journal of Symbolic Logic 68 (1):17-34.
    We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open problem formulated by J. (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  16. Lev D. Beklemishev (2003). Proof-Theoretic Analysis by Iterated Reflection. Archive for Mathematical Logic 42 (6):515-552.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Lev D. Beklemishev, Stephen Cook, Olivier Lessmann, Simon Thomas, Jeremy Avigad, Arnold Beckmann, Tim Carlson, Robert L. Constable & Kosta Došen (2003). 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium'02. Bulletin of Symbolic Logic 9 (1):71.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Lev Beklemishev (2002). Review: Wolfgang Burr, Fragments of Heyting Arithmetic. [REVIEW] Bulletin of Symbolic Logic 8 (4):533-534.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Lev Beklemishev (2001). Review: Ulrich Kohlenbach, On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness. [REVIEW] Bulletin of Symbolic Logic 7 (1):75-77.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Lev Dmitrievich Beklemishev (1999). Provability, Complexity, Grammars. American Mathematical Society.
    (2) Vol., Classification of Propositional Provability Logics LD Beklemishev Introduction Overview. The idea of an axiomatic approach to the study of ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  21. Lev Beklemishev (1998). Review: Per Lindstrom, Aspects of Incompleteness. [REVIEW] Journal of Symbolic Logic 63 (4):1606-1608.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Lev D. Beklemishev (1998). A Proof-Theoretic Analysis of Collection. Archive for Mathematical Logic 37 (5-6):275-296.
    By a result of Paris and Friedman, the collection axiom schema for $\Sigma_{n+1}$ formulas, $B\Sigma_{n+1}$ , is $\Pi_{n+2}$ conservative over $I\Sigma_n$ . We give a new proof-theoretic proof of this theorem, which is based on a reduction of $B\Sigma_n$ to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for $B\Sigma_n$ and to answer some technical questions left open by Sieg (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  23. Lev Beklemishev (1997). Notes on Local Reflection Principles. Theoria 63 (3):139-146.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  24. Lev D. Beklemishev (1997). Induction Rules, Reflection Principles, and Provably Recursive Functions. Annals of Pure and Applied Logic 85 (3):193-242.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Lev Beklemishev (1996). Review: Raymond M. Smullyan, Diagonalization and Self-Reference. [REVIEW] Journal of Symbolic Logic 61 (3):1052-1055.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Lev D. Beklemishev (1996). Bimodal Logics for Extensions of Arithmetical Theories. Journal of Symbolic Logic 61 (1):91-124.
    We characterize the bimodal provability logics for certain natural (classes of) pairs of recursively enumerable theories, mostly related to fragments of arithmetic. For example, we shall give axiomatizations, decision procedures, and introduce natural Kripke semantics for the provability logics of (IΔ 0 + EXP, PRA); (PRA, IΣ 1 ); (IΣ m , IΣ n ) for $1 \leq m etc. For the case of finitely axiomatized extensions of theories these results are extended to modal logics with propositional constants.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. Lev Beklemishev (1995). Iterated Local Reflection Versus Iterated Consistency. Annals of Pure and Applied Logic 75 (1-2):25-48.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Lev D. Beklemishev (1994). On Bimodal Logics of Provability. Annals of Pure and Applied Logic 68 (2):115-159.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  29. Sergei N. Artemov & Lev D. Beklemishev (1993). On Propositional Quantifiers in Provability Logic. Notre Dame Journal of Formal Logic 34 (3):401-419.
  30. Lev D. Beklemishev (1993). [Omnibus Review]. Journal of Symbolic Logic 58 (2):715-717.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31. Lev D. Beklemishev (1993). On the Complexity of Arithmetical Interpretations of Modal Formulae. Archive for Mathematical Logic 32 (3):229-238.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation