18 found
Sort by:
  1. Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten (2014). On Provability Logics with Linearly Ordered Modalities. Studia Logica 102 (3):541-566.
    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. 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  
  3. 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  
  4. T. Franzen & Lev D. Beklemishev (2008). REVIEWS-Inexhaustibility: A Non-Exhaustive Treatment and a Survey on Transfinite Progressions. Bulletin of Symbolic Logic 14 (2):258-259.
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. 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  
  6. 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.
    We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot be much improved: by adapting a (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Lev D. Beklemishev (2004). Provability Algebras and Proof-Theoretic Ordinals, I. Annals of Pure and Applied Logic 128 (1-3):103-123.
    We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work which has been (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. 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  
  9. Lev D. Beklemishev (2003). Proof-Theoretic Analysis by Iterated Reflection. Archive for Mathematical Logic 42 (6):515-552.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. 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  
  11. 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  
  12. 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  
  13. Lev D. Beklemishev (1997). Induction Rules, Reflection Principles, and Provably Recursive Functions. Annals of Pure and Applied Logic 85 (3):193-242.
    A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. 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  
  15. Lev D. Beklemishev (1994). On Bimodal Logics of Provability. Annals of Pure and Applied Logic 68 (2):115-159.
    We investigate the bimodal logics sound and complete under the interpretation of modal operators as the provability predicates in certain natural pairs of arithmetical theories . Carlson characterized the provability logic for essentially reflexive extensions of theories, i.e. for pairs similar to . Here we study pairs of theories such that the gap between and is not so wide. In view of some general results concerning the problem of classification of the bimodal provability logics we are particularly interested in such (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Sergei N. Artemov & Lev D. Beklemishev (1993). On Propositional Quantifiers in Provability Logic. Notre Dame Journal of Formal Logic 34 (3):401-419.
  17. Lev D. Beklemishev (1993). [Omnibus Review]. Journal of Symbolic Logic 58 (2):715-717.
    Reviewed Works:Dick de Jongh, Franco Montagna, Provable Fixed Points.Dick de Jongh, Franco Montagna, Much Shorter Proofs.Alessandra Carbone, Franco Montagna, Rosser Orderings in Bimodal Logics.Alessandra Carbone, Franco Montagna, Much Shorter Proofs: A Bimodal Investigation.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. 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