{"title":"A nonhybrid logic for crossworld predication","authors":"Evgeniy V. Borisov","doi":"10.21146/2074-1472-2023-29-2-125-147","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-125-147","url":null,"abstract":"Some sentences of natural languages, such as John might have been taller than Mary is, ascribe relations to objects each of which is associated with a possible world. In this example, Mary is associated with the actual world whereas John is associated with a possible world that can be distinct from the actual one. This phenomenon — the phenomenon of crossworld predication — cannot be reflected by means of standard modal logic. Some nonstandard logics accommodating crossworld predication have been proposed; the most expressive among them is Kocurek’s hybrid logic. All of them make use of nonstandard operators such as the operators of hybrid logic. In this paper, I propose a nonhybrid first-order modal logic for crossworld predication, CWPL, that demonstrates significant expressive power (though is less expressive than Kocurek’s hybrid logic) and has that advantage over other proposals that it makes no use of any nonstandard operators. Semantically, CWPL is based on crossworld interpretation of predicates that assigns extensions to each n-ary predicate with respect to n-tuples of possible worlds rather than single possible worlds. To be able to employ crossworld interpretation of predicates when evaluating formulae, I suggest relativizing truth values to partial functions from variables to possible worlds. In the paper, I describe CWPL’s syntax and semantics, provide a translation of CWPL into a two-sorted first-order logic, and compare it with Kocurek’s hybrid logic in terms of expressive power.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A natural generalization of the Turing computability model","authors":"Vladimir I. Shalack","doi":"10.21146/2074-1472-2023-29-2-9-35","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-9-35","url":null,"abstract":"The Turing computability model is a model of algorithmic symbolic transformations that can be performed by humans. The Church-Turing thesis is a statement about the completeness of their formalisms with respect to this model. Algorithmic transformations are applicable not only to symbols, but also to physical objects. Some of these transformations can be analyzed by means of Turing formalism by way of special character encoding. At the same time, there are physical algorithms that go far beyond the standard Turing model. Examples are recipes, medical procedures, technological processes, etc. Their common feature is not only the operation of physical objects, but also the appeal to external physical processes. The general definition of an algorithm, as prescriptions for a sequence of actions to obtain the desired result, is satisfied by well-known phenomena of goal-directed behavior. Symbolic calculations are a special case of goal-directed behavior. Models of combined temporal and dynamic logic can be used to analyze goal-directed behavior. Such an analysis allows us to conclude that there are at least three types of elementary rules underlying complex purposeful behavior: 1) passively-processual – \"If there is a process P , then do nothing, but wait for it to lead you to the desired goal G \"; 2) constructive – \"If there is a C , perform action d , the immediate result of which is the desired goal G \"; 3) constructively-processual – \"If C takes place, perform action d so that its immediate result R initiates process P , which will lead to the desired goal G \". The combined logic allows you to determine the conditions for the correctness of these rules. Constructively-processual rules have the property of universality, since two other types of rules are reduced to them. In the paper we define a T-machine (teleological machine) that implements complex goal-directed behavior, and conduct a comparative analysis with Turing machines. It is shown that within the framework of the new algorithmic model there are functions that are computable in it, but not computable in Turing model. In the new model, algorithms have the status of laws of living nature related to the emergence of life and evolution. The algorithmic model of goal-directed behavior can be naturally applied to describe and analyze many phenomena of the social sphere.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantum logic in the context of the mathematical foundation of quantum mechanics","authors":"Alexander A. Pechenkin","doi":"10.21146/2074-1472-2023-29-2-89-103","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-89-103","url":null,"abstract":"Quantum logic as it is presented in Birkhoff-von Neumann’s 1936 paper arose within the framework of the mathematical elaboration of the foundations of quantum mechanics. Birkhoff-von Neumann’s axiomatic was an alternative of the traditional formulation of foundations of quantum mechanics proceeding from the technique of the Hilbert space. It provided more economic formulation of the foundations of the theory. In Mackay’s writings it has been transformed into the axiomatic of quantum theory of probability. However, Mackay came back to the concept of Hilbert space as the fundamental for quantum mechanics. He also adopted the rules of super-selections in his presentation of the foundations of quantum mechanics. The contemporary approach to Birkhoff-von Neumann’s axiomatic is twofold: the criticism of their too rigid construction from the point of view of physics and the development in connection with mathematical intuitionism.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the question of the criteria for the paracompleteness of logics","authors":"Natalya E. Tomova","doi":"10.21146/2074-1472-2023-29-2-104-124","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-104-124","url":null,"abstract":"The paper discusses some aspects related to the definition of a paracomplete logics. There are various ways to formalize the basic condition of paracompleteness – the requirement of the presence in the logical system of such formulas that these formulas themselves and their negations are false. The corresponding definitions of the paracompleteness are given. It is indicated in which cases these definitions may be equivalent. The conditions of equivalence of the law of excluded middle φ ∨ ¬ φ , the law of Clavius ( ¬ φ → φ ) → φ and its special case ( φ → ¬ φ ) → ¬ φ are considered. The paper deals with issues related to the issues of the paracomplete negation, as well as its modal interpretation.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An axiomatization of quantum computational Logic","authors":"Vladimir L. Vasyukov","doi":"10.21146/2074-1472-2023-29-2-148-162","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-148-162","url":null,"abstract":"One of the logical proposals that arise from quantum computation is the idea to use the quantum theoretical formalism to represent parallel reasoning. To this aim a quantum computation is considered by means of convenient unitary operators assuming arguments and values in particular sets of qubit systems. Isolating some important unitary operators that have a special role in quantum computation (logical gates or quregisters) we obtain an opportunity to yield the language of Quantum Computational Logic (QCL) (cf. [Cattaneo et al., 2003; Cattaneo et al., 2004; Dalla Chiara et al., 2004]). The basic concept of the semantics of this language is the notion of quantum computational realization such that the meaning associated to any sentence is a quregister. Unlike the semantic of a standard quantum logic QCL-conjunction and QCL-disjunction do not correspond to lattice operations since they are not generally idempotent. Moreover, in QCL the weak distributivity principle breaks down and both the excluded middle and the non contradiction principles are violated. Finally, the axiomatizability of QCL is still an open problem. In the paper an axiomatization of QCL is proposed construing it as a kind of so-called Goldblatt’s binary logic. Some metalogical theorems (paraconsistency and completeness) are proved.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the three-valued expansions of Kleene's logic","authors":"Leonid Yu. Devyatkin","doi":"10.21146/2074-1472-2023-29-2-59-88","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-59-88","url":null,"abstract":"The paper is devoted to one of the most famous three-valued systems – Kleene's logic. The expressive capabilities of Kleene's logic and its three-valued expansions are described. We present two results. First, all possible three-valued expansions of Kleene's logic are found up to equivalence with respect to the mutual definability of connectives. It is shown that there are only twelve such expansions. This list includes both logics already known in the literature and completely new ones. For the found expansions, we describe the structure of the lattice ordered relative to the expressive power of its elements. Secondly, for Kleene's logic and its three-valued expansions we find how many extensions each of these logics has in the same language. Kleene's logic has only two proper extensions: the classical and the trivial ones. Generally, a three-valued logic in which Kleene's matrix is definable contains no more than three proper extensions: the classical one, the trivial one, and an intermediate logic, determined by the product of the the original logic's matrix and the matrix of classical logic in the same signature. Intermediate logics exist only for two types of three-valued expansions of Kleene's logic: in expansions equivalent to Łukasiewicz's logic, and in logics whose matrices contain both a bivalent submatrix, the universe of which consists of the classical truth values, and a submatrix, the universe of which consists the intermediate value alone. All three-valued expansions of Kleene's logic that do not preserve the classical values have only one extension of their own – the trivial one.","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simple example of blocking the Craig trick","authors":"Mikhail N. Rybakov","doi":"10.21146/2074-1472-2023-29-2-36-58","DOIUrl":"https://doi.org/10.21146/2074-1472-2023-29-2-36-58","url":null,"abstract":"William Craig observed that, under quite general conditions, a theory with a recursively enumerable axiomatization is also recursively axiomatizable. The paper discusses these conditions and builds a simple example of a theory for which the conditions of the Craig’s theorem are not satisfied; in particular, the constructed theory has a recursively enumerable axiomatization, but does not have a recursive axiomatization with the same set of inference rules. At the same time, extending the set of inference rules with some rules adm","PeriodicalId":489010,"journal":{"name":"Logičeskie issledovaniâ","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}