• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Proof-theoretic analysis by iterated reflection
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 7, 2026
Biologists Discover 'Molecular Fingerprint' of Preeclampsia
Researchers at HSE University employed a new method to model hypoxia in placental cells during pregnancies complicated by preeclampsia and identified molecular markers of tissue hypoxia. Since hypoxia is one of the key mechanisms underlying preeclampsia, these findings are important for a more accurate and timely diagnosis of the disease and for the development of effective treatment methods. The paper has been published in Placenta.
September 7, 2026
‘Speech, Facial Expressions, and Gestures Cannot Lie
Would you like to know whether a speaker’s trembling voice or an accidental gesture can give them away? At HSE University in Nizhny Novgorod, researchers are developing an algorithm that analyses speech, facial expressions, and gestures, and determines whether information is truthful with 92% accuracy. The project has applications ranging from forensic examination and bank recruitment to fundamental research. Anna Khomenko, head of the research group and Senior Research Fellow at the Centre for Language and Brain at the HSE Faculty of Humanities in Nizhny Novgorod, explains how students and researchers are working together to create a corpus of video recordings, train a classifier, and prepare to introduce computer vision technology.
September 4, 2026
Time to Showcase Your Research: Applications Are Now Open for Student Research Paper Competition 2026
Taking part in the Student Research Paper Competition (SRPC) gives you an opportunity to present your research to experts, receive an independent assessment, and determine the future direction of your work. The competition is open to students graduating in 2026 not only from HSE University but from universities in Russia and abroad. Papers may be submitted in Russian and English, and in some fields also in French, German, and Spanish.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Proof-theoretic analysis by iterated reflection

P. 225–270.
Beklemishev L. D.

Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. Moreover, they provide a uniform definition of a proof-theoretic ordinal for any arithmetical complexity Π0nΠn0. We discuss various notions of proof-theoretic ordinals and compare the information obtained by means of the reflection principles with the results obtained by the more usual proof-theoretic techniques. In some cases we obtain sharper results, e.g., we define proof-theoretic ordinals relevant to logical complexity Π01Π10. We provide a more general version of the fine structure relationships for iterated reflection principles (due to Ulf Schmerl). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣnIΣn, IΣ−nIΣn−, IΠ−nIΠn− and their combinations. We also obtain new conservation results relating the hierarchies of uniform and local reflection principles. In particular, we show that (for a sufficiently broad class of theories T) the uniform Σ1Σ1-reflection principle for T is Σ2Σ2-conservative over the corresponding local reflection principle. This bears some corollaries on the hierarchies of restricted induction schemata in arithmetic and provides a key tool for our generalization of Schmerl’s theorem.

Language: English
DOI
Keywords: proof theoryordinal analysisreflection principlesTuring progressions

In book

Turing's Revolution. The Impact of His Ideas about Computability. Giovanni Sommaruga and Thomas Strahm, eds., Birkhäuser, Basel, 2015
Basel: Birkhauser/Springer, 2015.
Similar publications
Отмеченное субординатное натуральное исчисление для базовой интуиционистской кондициональной логики
Zaitsev I., Логические исследования 2025 Т. 31 № 2 С. 143–168
This article presents a labeled Fitch-style natural deduction system, 𝓕IntCK, for the basic propositional intuitionistic conditional logic IntCK introduced by G.K. Olkhovikov. The logic IntCK serves as a correct intuitionistic counterpart to Chellas' minimal conditional logic CK, designed to accommodate Lewis' strong and weak counterfactual conditionals within a single framework. In order to do this, IntCK features two independent logical connectives, namely □→ and ◇→, ...
Added: November 23, 2025
Logical Perspectives 2021 Workshop
M.: [б.и.], 2021.
The Logical Perspectives Summer School and Workshop Series aims at giving advanced introductions into various branches of logic, and providing researchers — including early career scientists — with an opportunity to present their work. In particular, LP 2021 Summer School (June 14–16) and Workshop (June 17–19) will focus on computational proof theory, broadly understood. The programme will comprise three ...
Added: December 14, 2021
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities
Kanovich M., Kuznetsov S., Scedrov A., Journal of Logic and Computation 2020 Vol. 30 No. 1 P. 239–256
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called ‘Lambek’s restriction’, i.e. the antecedent of any provable sequent should be non-empty. In this paper, we discuss ways of extending the Lambek calculus with the linear logic exponential modality ...
Added: July 1, 2020
From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic
Pavlova A., Lang T., Fermüller, C., , in: Information Processing and Management of Uncertainty in Knowledge-Based Systems 18th International Conference, IPMU 2020, Lisbon, Portugal, June 15–19, 2020, Proceedings, Part IVol. 1237. Issue 1.: Springer, 2020. P. 257–270.
We introduce a game for (extended) Gödel logic where the players’ interaction stepwise reduces claims about the relative order of truth degrees of complex formulas to atomic truth comparison claims. Using the concept of disjunctive game states this semantic game is lifted to a provability game, where winning strategies correspond to proofs in a sequents-of-relations calculus. ...
Added: June 3, 2020
Axiomatizing Provable n-Provability
Beklemishev L. D., Kolmakov E., Doklady Mathematics 2018 Vol. 98 No. 3 P. 582–585
The set of all formulas whose n-provability in a given arithmetical theory S is provable in another arithmetical theory T is a recursively enumerable extension of S. We prove that such extensions can be naturally axiomatized in terms of transfinite progressions of iterated local reflection schemata over S. Specifically, the set of all provably 1-provable ...
Added: June 24, 2019
Axiomatization of provable n-provability
Kolmakov E., Beklemishev L. D., Journal of Symbolic Logic 2019 Vol. Volume 84 No. Issue 2 P. 849–869
A formula φ is called n-provable in a formal arithmetical theory S if φ is provable in S together with all true arithmetical Πn-sentences taken as additional axioms. While in general the set of all n-provable formulas, for a fixed n>0 , is not recursively enumerable, the set of formulas φ whose n-provability is provable ...
Added: June 24, 2019
The undecidability theorem for the Horn-like fragment of linear logic (Revisited).
Max I. Kanovich, Mathematical Structures in Computer Science 2016 Vol. 26 No. 5 P. 719–744
In their seminal paper: Lincoln, P., Mitchell, J., Scedrov, A. and Shankar, N. (1992). Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1–3) 239–311, LMSS have established an extremely surprising result that propositional linear logic is undecidable. Their proof is very complex and involves numerous nested inductions of different kinds. Later an alternative ...
Added: September 1, 2016
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit