Dzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal logic, Annals of Pure and Applied Logic 61 113-160. A tree Tr of theories T1,...,Tn is called tolerant, if there are consistent extensions T+1,...,T+n of T1,...,Tn, where each T+i interprets its successors in the tree Tr. We consider a propositional language with the following modal formation rule: if Tr is a tree of formulas, then Tr is a formula, and axiomatically define in this language the decidable logics (...) TLR and TLRω. It is proved that TLR yields exactly the schemata of PA-provable sentences, if Tr is understood as “Tr is tolerant”. In fact, TLR axiomatizes a considerable fragment of provability logic with quantifiers over ∑1-sentences, and many relations that have been studied in the literature can be expressed in terms of tolerance. We introduce and study two more relations between theories: cointerpretability and cotolerance which are, in a sense, dual to interpretability and tolerance. Cointerpretability is a characterization of ∑1-conservativity for essentially reflexive theories in terms of translations. (shrink)

Formulas of the propositional modal language with the unary modal operators □, Σ1, 1, Σ2, 2,… are considered as schemata of sentences of arithmetic , where □A is interpreted as “A is PA-provable”, ΣnA as “A is PA-equivalent to a Σn-sentence” and nA as “A is PA-equivalent to a Boolean combination of Σn-sentences”. We give an axiomatization and show decidability of the sets of the modal formulas which are schemata of: PA-provable, true arithmetical sentences.

A law is one of the basic concepts of the dialectical materialist conception of determinism as a philosophical theory of the objective interrelationship and mutual conditioning of phenomena in the material and mental world. A law establishes a rigorously determined connection among circumstances, i.e., a totality of derivative components and conditions of their actions and results. By overlooking the existence of two different levels—the concept and the objective reality corresponding to it—some philosophers erroneously interpret Marx's theses concerning the approximateness of (...) the realization of the laws of society. Let us take, for example, Marx's thesis that "In general, in capitalist production general laws are realized in a very confused and approximate way, merely as a prevailing tendency, as a kind of average among constant fluctuations that is never solidly established."1 Some investigators see this as an objectively existing social law in itself, attributing to it an "inexactitude" of operation, variation, and approximation, instead of seeing it as a specific application of a particular law. They thus forget that Marx said, in the Foreword to the very first volume of Capital: "The question does not specifically have to do with a greater or lesser degree of development of the social antagonisms that derive from the natural laws of capitalist production, but rather lies in these laws themselves, these trends, which operate and are realized with iron necessity.". (shrink)

We show that the e-degree 0'e and the map u ↦ u' are definable in the upper semilattice of all e-degrees. The class of total e-degrees ≥0'e is also definable.

A nonempty sequence T1,...,Tn of theories is tolerant, if there are consistent theories T 1 + ,..., T n + such that for each 1 i n, T i + is an extension of Ti in the same language and, if i n, T i + interprets T i+1 + . We consider a propositional language with the modality , the arity of which is not fixed, and axiomatically define in this language the decidable logics TOL and TOL. It is (...) shown that TOL (resp. TOL) yields exactly the schemata of PA-provable (resp. true) arithmetical sentences, if (A1,..., An) is understood as (a formalization of) PA+A1, ..., PA+An is tolerant. (shrink)

Predicate modal formulas are considered as schemata of arithmetical formulas, where is interpreted as the standard formula of provability in a fixed sufficiently rich theory T in the language of arithmetic. QL T(T) and QL T are the sets of schemata of T-provable and true formulas, correspondingly. Solovay's well-known result — construction an arithmetical counterinterpretation by Kripke countermodel — is generalized on the predicate modal language; axiomatizations of the restrictions of QL T(T) and QL T by formulas, which contain no (...) variables different from x, are given by means of decidable prepositional bimodal systems; under the assumption that T is 1-complete, there is established the enumerability of the restrictions of QL T(T) and QL T by: 1) formulas in which the domains of different occurrences of don't intersect and 2) formulas of the form n A. (shrink)

Predicate modal formulas with non-modalized quantifiers (call them Q-formulas) are considered as schemata of arithmetical formulas, where is interpreted as the provability predicate of some fixed correct extension T of arithmetic. A method of constructing 1) non-provable in T and 2) false arithmetical examples for Q-formulas by Kripke-like countermodels of certain type is given. Assuming the means of T to be strong enough to solve the (undecidable) problem of derivability in QGL, the Q-fragment of the predicate version of the logic (...) GL, we prove the recursive enumerability of the sets of Q-formulas all arithmetical examples of which are: 1) T-provable, 2) true. In. particular, the first one is shown to be exactly QGL and the second one to be exactly the Q-fragment of the predicate version of Solovay's logic S. (shrink)

The paper proves a predicate version of Solovay's well-known theorem on provability interpretations of modal logic: If a closed modal predicate-logical formula R is not valid in some finite Kripke model, then there exists an arithmetical interpretation f such that $PA \nvdash fR$ . This result implies the arithmetical completeness of arithmetically correct modal predicate logics with the finite model property (including the one-variable fragments of QGL and QS). The proof was obtained by adding "the predicate part" as a specific (...) addition to the standard Solovay construction. (shrink)

[1] Sefer Orḥot Ḥayim leha-Rosh ʻim beʼur "ha-Shem orḥotenu" ... 2. Ḳunṭres Be-Shaʻar ha-melekh ʻal haḳdamat ha-Rambam, kolel tsiyunim u-meḳorim u-veʼurim be-divre ha-Rambam ṿeha-Raʼabad ... 3. Ḳunṭres Tashlum yefeh ʻenayim ʻal Seder Zeraʻim u-Ṭehorot, ʻeduyot, Tamid, Midot, Ḳenim ṿe-ʻod ṿe-hu tsiyunim ʻal mas. elu mi-Yerushalmi u-midrashim ... 4. Ḳunṭres Marʼot maḳom, ṿe-hu tsiyunim ʻal ha-meḳomot she-Rashi ṿe-Tos. meviʼim mirdrash o Yerushalmi ṿe-Tosefta ṿe-khu. ṿe-lo tsuyan meḳoro ... 5. Ḳunṭres Ṭeʻama de-ḳara, ṿe-hu ḳetsat ḥidushim ʻal ha-Torah ṿe-ʻal Neviʼim u-Khetuvim -- ḥeleḳ (...) 3. Heʻarot ʻal seder ha-Shas (ṿe-kholel gam ezeh ḳunṭresim). (shrink)

The technical literature actively discusses ideas for creating digital twins to solve a wide range of problems that arise for enterprises of various kinds. Advances in the areas of information technology and the development of the necessary software really make it possible to obtain important new results through the creation of digital twins. This paper proposes the concept of building a network of digital twins, used to solve a number of actual problems in complex telecommunication systems. Two applications are considered (...) examples of such tasks. The first application is the organization of information feedback for enterprises involved in the life cycle of a telecommunication network: “elaboration of modernization principles, development of equipment, design, construction, and operation.” The second application is monitoring traffic, including its atypical behavior, in order to avoid the recurrence of erroneous actions in case of emergency situations. Another important feature of the digital twin network is that it will become an effective tool for conducting interdisciplinary research. (shrink)