Principles for pre-trial investigation planning under simplified procedure

The purpose of the article is to study the organizational and legal framework for the functioning of the institution of pre-trial investigation planning under simplified procedure. The subject of the study is the planning of a pre-trial investigation under simplified procedure. Methodology. General scientific and special scientific methods were used in the course of the research: formal and logical; description; historical and legal; comparative and legal; dogmatic. Results of the research. The concept, essence, as well as the basic scientific doctrines concerning functioning of institution of planning are investigated; the content of the legal support for pre-trial investigation under simplified procedure is clarified. Practical meaning. The content and essence of the relevant process in the context of pre-trial investigation under simplified procedure are outlined; the main elements of legal support for the functioning of this institution are allocated; the author’s view on the positive and negative features of pre-trial investigation planning as the management tool is provided. Value / originality. The further steps to optimize the functioning of the institution of planning for pre-trial investigation of criminal offenses are proposed.

Logic prototyping: approach and use cases

In this article, we present an approach to prototyping complex systems and processes using classical predicate logic. The prototype is built by the interpreter based on a logical description of the properties and/or behavior of the designed system. The description contains the definitions of the prototype elements and the constraints that the correct prototype must satisfy. Definitions are used to build a prototype, and constraints are used to analyze it and check the required properties. Definitions are interpreted using direct logic inference, constraints are only checked on the resulting model. A wider class of formulas is used than in well-known logical languages. Computable logical and denotational semantics are defined for them. In the process of building a prototype, logical errors of uncertainty, redefinition of functions, and contradictions are diagnosed. We are given examples of prototype descriptions used for semantic program analysis, space training, transport system design.

The concept, characteristics, and classification of mechanisms for implementing the principles of the rule of law

The purpose of this article is to consider the characteristics and classification of mechanisms for implementing the principles of the rule of law. Such mechanisms should become the object of purposeful formation. The principles of the rule of law in modern societies cannot be implemented "automatically", it is necessary to outline the directions of work on the implementation of such realization precisely within the framework of unified mechanisms as complexes of applied means and the activities of relevant subjects. To achieve this goal, it seems necessary to define these mechanisms as tasks, to consider the specific characteristics that mechanisms for implementing the principles of the rule of law should have, including modern Russia; to divide these mechanisms on essential grounds. It has been assumed to use several research methods to solve the tasks set: logical (description, classification), formal-dogmatic, comparative. As a result of the study, it has been revealed that the mechanisms for implementing the principles of the rule of law should be a set of tools, technologies, and procedures for such implementation, as well as the entities implementing this realization.

The history of the early attempts to apply the algebra of logic to engineering problems

The development of electric engineering led to the emergence of relay-contact systems that included dozens of relays and contacts in some areas of technology (interlocking in naval turret artillery, automated statistical calculations, etc.) back in the 1880s and 1890s. Due to their relative simplicity, notwithstanding certain expenses, such systems were designed without using the apparatus of the algebra of logic. At the same time, the need in logical description of the functioning of complicated technological systems had arisen in the railroad sector (central mechanical signal and switch control). Such descriptions that actually used binary variables had been created by the French and Belgian engineering practitioners. The operators of one of such systems, i.e. Armand Flamache’s system, were functionally the same as logical operators of the algebra of logic, while lacking a wide set of properties inherent in the latters. Flamache’s system did not go any further and was forgotten although, despite its being narrowly specialized, was the first portent of using the algebra of logic in technology.

THE EXPRESSION OF AUTHOR'S INTENTION IN HISTORIOGRAPHICAL TEXTS

The article presents the analysis of author's self-presentation means in historiographical texts. The author of a historiographical text studies scientific context of historic events and therefore acts as a historian and historiographer. The current study enabled to discover the major strategies of expressing author's intentions. Those turned out to be objectiveness, appeal to documents, detached subjectivity, explicit evaluation and argumentation strategies. Dialog strategy was in the periphery. It was found that historiographical texts show the dominants common for scientific discourse in general including a pattern of “a research analyst” who uses certain techniques of proving a hypothesis by means of elaborated logical description and reasoning. The analysis of linguistic means of expressing author's intentions enabled to reveal explicit and implicit indications of those strategies. The explicit ones included adjectives sometimes used with intensifiers; nouns; set expressions and phrases with evaluative meaning; an appeal to other scientists opinion with the abundance of quotations and references. The implicit ones contained argumentation strategies including author's comments with unfortunately rare appeal to the analyst's own research results and dialog strategies with interrogative sentences and question-answer patterns indicating them.

On Some Properties of Positive and Strongly Positive Arithmetical Sets

The notions of positive and strongly positive arithmetical sets are defined as in [1]-[4] (see, for example, [2], p. 33). It is proved (Theorem 1) that any arithmetical set is positive if and only if it can be defined by an arithmetical formula containing only logical operations ∃, &,∨ and the elementary subformulas having the forms 𝑥𝑥=0 or 𝑥𝑥=𝑦𝑦+1, where 𝑥𝑥and 𝑦𝑦 are variables.Corollary:the logical description of the class of positive sets is obtained from the logical description of the class of strongly positive sets replacing the list of operations &,∨ by the list ∃, &,∨. It is proved (Theorem 2) that for any one-dimensional recursively enumerable set 𝑀𝑀 there exists 6- dimensional strongly positive set 𝐻𝐻 such that 𝑥𝑥 ∈𝑀𝑀 holds if and only if (1, 2𝑥𝑥, 0, 0, 1, 0)∈𝐻𝐻+, where 𝐻𝐻+ is the transitive closure of 𝐻𝐻.