The following pages link to Lev D. Beklemishev (Q636315):
Displaying 42 items.
- Franco Montagna's work on provability logic and many-valued logic (Q300553) (← links)
- Positive provability logic for uniform reflection principles (Q392274) (← links)
- Foreword to the special issue dedicated to the memory of Leo Esakia (Q454392) (← links)
- On provability logics with linearly ordered modalities (Q456968) (← links)
- Topological completeness of the provability logic GLP (Q490656) (← links)
- Kripke semantics for provability logic GLP (Q636316) (← links)
- On the complexity of arithmetical interpretations of modal formulae (Q688859) (← links)
- (Q804563) (redirect page) (← links)
- Provability logics for natural Turing progressions of arithmetical theories (Q804564) (← links)
- Independent numerations of theories and recursive progressions (Q1204765) (← links)
- Provability logic without Craig's interpolation property (Q1263572) (← links)
- A proof-theoretic analysis of collection (Q1267837) (← links)
- On propositional quantifiers in provability logic (Q1317986) (← links)
- On bimodal logics of provability (Q1332858) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Proof-theoretic analysis by iterated reflection (Q1407608) (← links)
- On the reflection calculus with partial conservativity operators (Q1685909) (← links)
- A universal algebra for the variable-free fragment of \({\mathrm{RC}^\nabla}\) (Q1709691) (← links)
- Axiomatizing provable \(n\)-provability (Q1732059) (← links)
- On the query complexity of finding a local maximum point. (Q1853165) (← links)
- Provability algebras and proof-theoretic ordinals. I (Q1877092) (← links)
- Iterated local reflection versus iterated consistency (Q1899141) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Conservativity spectra and Joosten-Fernández model (Q2079167) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- On the reduction property for GLP-algebras (Q2358595) (← links)
- A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- (Q3001092) (← links)
- Sergei Ivanovich Adian (on his eightieth birthday) (Q3008002) (← links)
- Ordinal Completeness of Bimodal Provability Logic GLB (Q3019966) (← links)
- (Q3081639) (← links)
- Gödel incompleteness theorems and the limits of their applicability. I (Q3082390) (← links)
- (Q3362800) (← links)
- Reflection principles and provability algebras in formal arithmetic (Q3372439) (← links)
- On some slowly terminating term rewriting systems (Q3466405) (← links)
- A many-sorted variant of Japaridze’s polymodal provability logic (Q5095650) (← links)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
- Sergei Ivanovich Adian (on his 75th birthday) (Q5296745) (← links)
- Propositional primal logic with disjunction (Q5406129) (← links)
- A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic (Q5696302) (← links)
- Gregory Samuilovich Tseytin (obituary) (Q6184487) (← links)
