Сборник составили статьи, посвященные отдельным направлениям работы философа, воспоминания его друзей и коллег, а также поздние тексты самого Л. Н. Митрохина, в которых он рассказывает о своем жизненном и творческом пути.

Lev Nikolaevich Tolstoy’s departure from this earth took place in 1910, a year that has since become a common touchstone for Russians. The twentieth century came to a symbolic close, beginning a te...

The spiritual geography of Russian cosmism. General characteristics ; Recent definitions of cosmism -- Forerunners of Russian cosmism. Vasily Nazarovich Karazin (1773-1842) ; Alexander Nikolaevich Radishchev (1749-1802) ; Poets: Mikhail Vasilyevich Lomonosov, (1711-1765) and Gavriila Romanovich Derzhavin (1743-1816) ; Prince Vladimir Fedorovich Odoevsky (1803-1869) ; Aleksander Vasilyevich Sukhovo-Kobylin (1817-1903) -- The Russian philosophical context. Philosophy as a passion ; The destiny of Russia ; Thought as a call for action ; The totalitarian cast of mind -- The religious and (...) spiritual context. The kingdom of god on earth ; Hesychasm: two great Russian saints ; The Third Rome ; Pre-Christian antecedents -- The Russian esoteric context. Early searches for "deep wisdom" ; Popular magic ; Higher magic in the time of Peter the Great ; Esotericism after Peter the Great ; Theosophy and anthroposophy -- Nikolai Fedorovich Fedorov (1829-1903), the philosopher of the common task ; The one idea ; The unacknowledged prince ; The village teacher ; First disciple: Dostoevsky and Tolstoy ; The Moscow librarian ; Last years: Askhabad: the only portrait -- The "common task" ; Esoteric dimensions of the "common task" ; Fedorov's legacy: projectivism, delo, regulation -- The religious cosmists. Vladimir Sergeevich Solovyov (1853-1900) ; Sergei Nikolaevich Bulgakov (1871-1944) ; Pavel Aleksandrovich Florensky (1882-1937) ; Nikolai Aleksandrovich Berdyaev (1874-1948) -- The scientific cosmists. Konstantin Edouardovich Tsiolkovsky (1857-1935) ; Vladimir Ivanovich Vernadsky (1863-1945) ; Alexander Leonidovich Chizhevsky (1897-1964) ; Vasily Feofilovich Kuprevich (1897-1969) -- Promethean theurgy. Life-creation ; Cultural immortalism ; God-building ; Re-aiming the arrows of Eros ; Technological utopianism ; Occultism -- Fedorov's twentieth century followers. Nikolai Pavlovich Peterson (1844-1919) and Vladimir Aleksandrovich Kozhevnikov (1852-1917) ; Svyatogor and the biocosmists ; New wine and the universal task ; Alexander Konstantinovich Gorsky (1886-1943) and Nikolai Alexandrovich Setnitsky (1888-1937) ; Valerian Nikolaevich Muravyov (1885-1932) ; Vasily Nikolaevich Chekrygin (1897-1922) -- Cosmism and its offshoots today. The N.F. Fedorov museum-library ; The Tsiolkovsky museum and Chizhevsky center ; ISRICA - Institute for Scientific Research in Cosmic Anthropoecology ; Lev Nikolaevich Gumilev (1912-1992) and neo-eurasianism ; The hyperboreans ; Scientific immortalism: Igor Vishev, Danila Medvedev ; Conclusions about the Russian cosmists. (shrink)

I have had occasion to hear that your interest in Eurasianism, Lev Nikolaevich, manifested itself very early, practically in your student years, and in any case before Eurasianism became the fashion. Could you tell us how exactly you became familiar with these ideas, or, in other words, how you discovered Eurasianism?

I have had occasion to hear that your interest in Eurasianism, Lev Nikolaevich, manifested itself very early, practically in your student years, and in any case before Eurasianism became the fashion. Could you tell us how exactly you became familiar with these ideas, or, in other words, how you discovered Eurasianism?

V.K.: Vladislav Aleksandrovich, you have come a long way in your scientific career: from a student of the class of 1955 in the Philosophy Faculty of Moscow State University to a corresponding member of the Russian Academy of Sciences, head of the sector of the theory of knowledge and head of the division of epistemology and logic at the Institute of Philosophy of the RAS, and editor in chief of our country's leading philosophy journal Voprosy filosofii. Your field of research (...) is the theory of knowledge and the philosophy of science or, to be more specific, the cultural-historical analysis of knowledge from the point of view of the activity approach. As far as I know, the psychological aspect of the activity approach to the study of consciousness and knowledge was developed by the psychologists Lev Semenovich Vygotsky, his student Aleksei Nikolaevich Leontiev, Aleksandr Romanovich Luria, and Petr Iakovlevich Galperin. Leontiev, Luria, and Galperin were professors at the Philosophy Faculty of MGU at the time you were studying there. Tell me, did you develop your scientific interests under the influence of the Moscow school of cultural-historical psychology? (shrink)

The Many-Worlds Interpretation (MWI) is an approach to quantum mechanics according to which, in addition to the world we are aware of directly, there are many other similar worlds which exist in parallel at the same space and time. The existence of the other worlds makes it possible to remove randomness and action at a distance from quantum theory and thus from all physics.

It is argued that the many-worlds interpretation is by far the best interpretation of quantum mechanics. The key points of this view are viewing the wave functions of worlds in three dimensions and understanding probability through self-locating uncertainty.

This is a philosophical paper in favor of the many-worlds interpretation of quantum theory. The necessity of introducing many worlds is explained by analyzing a neutron interference experiment. The concept of the “measure of existence of a world” is introduced and some difficulties with the issue of probability in the framework of the MWI are resolved.

The main focus of the book is the presentation of the 'inertial' view of population growth. This view provides a rather simple model for complex population dynamics, and is achieved at the level of the single species without invoking species interactions. An important part of this account is the maternal effect. Investment of mothers in the quality of their daughters makes the rate of reproduction of the current generation depend not only on the current environment, but also on the environment (...) experienced by the previous generation. (shrink)

Several situations, in which an empty wave causes an observable effect, are reviewed. They include an experiment showing ‘‘surrealistic trajectories’’ proposed by Englert et al. and protective measurement of the density of the quantum state. Conditions for observable effects due to empty waves are derived. The possibility (in spite of the existence of these examples) of minimalistic interpretation of Bohmian quantum mechanics in which only Bohmian positions supervene on our experience is discussed.

ABSTRACT We consider several ways in which a good understanding of modern techniques and principles in physics can elucidate ecology, and we focus on analogical reasoning between these two branches of science. Analogical reasoning requires an understanding of both sciences and an appreciation of the similarities and points of contact between the two. In the current ecological literature on the relationship between ecology and physics, there has been some misunderstanding about the nature of modern physics and its methods. Physics is (...) seen as being much cleaner and tidier than ecology. When compared to this idealized, fictional version of physics, ecology looks very different, and the prospect of ecology and physics learning from one another is questionable. We argue that physics, once properly understood, is more like ecology than ecologists have thus far appreciated. Physicists and ecologists can and do learn from each other, and, in this paper, we outline how analogical reasoning can facilitate such exchanges. (shrink)

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 (...) of GLP Λ. (shrink)

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and ω, where ω corresponds to the full uniform reflection schema, whereas n<ω corresponds to its restriction to arithmetical Πn+1-formulas. This (...) calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time. (shrink)

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 (...) [23] and Hájek [9]. We also give a new proof of independence of $B\Sigma_{n+1}$ over $I\Sigma_n$ by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8]. (shrink)

What is the most important reason for using Computer Vision methods in humanities research? In this article, I argue that the use of numerical representation and data analysis methods offers a new language for describing cultural artifacts, experiences and dynamics. The human languages such as English or Russian that developed rather recently in human evolution are not good at capturing analog properties of human sensorial and cultural experiences. These limitations become particularly worrying if we want to compare thousands, millions or (...) billions of artifacts—i.e. to study contemporary media and cultures at their new twenty-first century scale. When we instead use numerical measurements of image properties standard in Computer Vision, we can better capture details of a single artifact as well as visual differences between a number of artifacts–even if they are very small. The examples of visual dimensions that numbers can capture better then languages include color, shape, texture, contours, composition, and visual characteristics of represented faces, bodies and objects. The methods of finding structures and relationships in large numerical datasets developed in statistics and machine learning allow us to extend this analysis to very big datasets of cultural objects. Equally importantly, numerical image features used in Computer Vision also give us a new language to represent gradual and continuous temporal changes—something which natural languages are also bad at. This applies to both single artworks such as a film or a dance piece and also to changes in visual characteristics in millions of artifacts over decades or centuries. (shrink)

Prominent thinkers such as Jurgen Habermas and Michael Sandel are warning that biomedical enhancements will undermine fundamental political values. Yet whether biomedical enhancements will undermine such values depends on how biomedical enhancements will function, how they will be administered and to whom. Since only few enhancements are obtainable, it is difficult to tell whether these predictions are sound. Nevertheless, such warnings are extremely valuable. As a society we must, at the very least, be aware of developments that could have harmful (...) consequences. Indeed, if important values were to be jeopardized, we should take appropriate measures to protect them. This paper focuses on four central values: solidarity, personal responsibility, equality and autonomy. It delineates the conditions under which biomedical enhancements would undermine these values. It also details the circumstances under which these values would be unaffected by enhancements as well as those under which they would be promoted. Specifying these conditions is valuable; it would enable society to prepare appropriate ethical guidelines and policy responses in advance. (shrink)

The first volume in the new critical edition of Lev Shestov's work in English, which I have been asked to coordinate. The volume includes my preface and annotations.

Śiḥot maran ha-Mashgiaḥ Mohari Leṿinshṭain, zatsal -- Ḥidushe torato ʻa. Mas. B.ḳ. ṿe-liḳuṭim -- Leḳeṭ mi-maʼamraṿ mi-moreshet Daṿid Heber ṿe-ʻinyene ha-shaʻah.

For “natural enough” systems of ordinal notation we show that α times iterated local reflection schema over a sufficiently strong arithmetic T proves the same Π 1 0 -sentences as ω α times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at ε-numbers. We also derive the following more general “mixed” formulas estimating the consistency strength of iterated local reflection: for all ordinals α ⩾ 1 and all β, β ≡ Π 1 0 (...) T ω α · , α ≡ Π 1 0 T β + ω α . Here T α stands for α times iterated local reflection over T , T β stands for β times iterated consistency, and ≡ Π 1 0 denotes mutual Π 1 0 -conservativity. In an appendix to this paper we develop our notion of “natural enough” system of ordinal notation and show that such systems do exist for every recursive ordinal. (shrink)

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. (...) Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces are called GLP-spaces whenever they satisfy all the axioms of GLP. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces.

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 (...) times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. 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 Π1 0 and, similarly, for any class Π n 0 . We provide a more general version of the (...) fine structure relationships for iterated reflection principles (due to U. Schmerl [25]). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣ n , IΣ n − , IΠ 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-reflection principle for T is Σ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. (shrink)

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 (...) done in the last two decades on provability logic and reflection principles. Because of its abstract algebraic nature, we hope that it will also be of interest for non-prooftheorists. (shrink)

It is argued that, although in the Many-Worlds Interpretation of quantum mechanics there is no ``probability'' for an outcome of a quantum experiment in the usual sense, we can understand why we have an illusion of probability. The explanation involves: a). A ``sleeping pill'' gedanken experiment which makes correspondence between an illegitimate question: ``What is the probability of an outcome of a quantum measurement?'' with a legitimate question: ``What is the probability that ``I'' am in the world corresponding to that (...) outcome?''; b). A gedanken experiment which splits the world into several worlds which are identical according to some symmetry condition; and c). Relativistic causality, which together with explain the Born rule of standard quantum mechanics. The Quantum Sleeping Beauty controversy and ``caring measure'' replacing probability measure are discussed. (shrink)

Two recently proposed quantum experiments are analyzed. The first allows to find an object without "touching" it. The second allows to teleport quantum states, transmitting a very small amount of information. It is shown that in the standard approach these experiments are in conflict with the intuitive notions of causality and locality. It is argued that the situation is less paradoxical in the framework of the many-worlds interpretation of quantum theory.

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 (...) pairs that is axiomatized over by ∏1-sentences only, and, for each n 1, proves the n-times iterated consistency of . A complete axiomatization, along with the appropriate Kripke semantics and decision procedures, is found for the two principal cases: finitely axiomatizable extensions of this sort, like e.g. ), ), etc., and reflexive extensions, like ¦n 1\s}), etc. We show that the first logic, ICP, is the minimal and the second one, RP, is the maximal within the class of the provability logics for such pairs of theories. We also show that there are some provability logics lying strictly between these two. As an application of the results of this paper, in the last section the polymodal provability logics for natural recursive progressions of theories based on iteration of consistency are characterized. We construct a system of ordinal notation , which gives exactly one notation to each constructive ordinal, such that the logic corresponding to any progression along coincides with that along natural Kalmar elementary well-orderings. (shrink)

We elaborate Weiermann-style phase transitions for well-partial-orderings (wpo) determined by iterated finite sequences under Higman-Friedman style embedding with Gordeev’s symmetric gap condition. For every d-times iterated wpo \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}\right)}$$\end{document} in question, d > 1, we fix a natural extension of Peano Arithmetic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T \supseteq \sf{PA}}$$\end{document}, that proves the corresponding second-order sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{WPO}\left({\rm (...) S}{\textsc{eq}}^{d}, \trianglelefteq _{d}\right) }$$\end{document}. Having this we consider the following parametrized first-order slow well-partial-ordering sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}, r\right):}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \forall K > 0 \right) \left( \exists M > 0\right) \left( \forall x_{0},\ldots,x_{M}\in {\rm S}\text{\textsc{eq}}^{d}\right)$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left( \forall i\leq M\right) \left( \left| x_{i}\right| 1}$$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d},r \right) }$$\end{document} is not provable in T.Moreover, by the well-known proof theoretic equivalences we can just as well replace T by PA or ACA0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta _{1}^{1}\sf{CA}}$$\end{document}, if d = 2 and d = 3, respectively.In the limit case d → ∞ we replaceEFA-provably computable reals r by EFA-provably computable functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f: \mathbb{N} \rightarrow \mathbb{R}_{+}}$$\end{document} and prove analogous theorems. (In the sequel we denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}_{+}}$$\end{document} the set of EFA-provably computable positive reals). In the basic case T = PA we strengthen the basic phase transition result by adding the following static threshold clause\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1\right)}$$\end{document} is still provable in T = PA (actually in EFA). Furthermore we prove the following dynamic threshold clauses which, loosely speaking are obtained by replacing the static threshold t by slowly growing functions 1α given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${1_{\alpha }\left( i\right)\,{:=}\,1+\frac{1}{H_{\alpha }^{-1}\left(i\right) }, H_{\alpha}}$$\end{document} being the familiar fast growing Hardy function and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\alpha }^{-1}\left( i\right)\,{:=}\,\rm min \left\{ j \mid H_{\alpha } \left ( j\right) \geq i \right\}}$$\end{document} the corresponding slowly growing inversion. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha < \varepsilon _{0}}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1_{\alpha}\right)}$$\end{document} is provable in T = PA. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left( {\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2},1_{\varepsilon _{0}}\right)}$$\end{document} is not provable in T = PA. We conjecture that this pattern is characteristic for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T\supseteq \sf{PA}}$$\end{document} under consideration and their proof-theoretical ordinals o (T ), instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon _{0}}$$\end{document}. (shrink)