Digital transformation of russian customs authorities’ activities on the example of automatic release technology

The article considers the main factors limiting the use of automatic release technology in electronic customs declarations. The directions of further development of the potential of the investigated technology in the conditions of digitalisation, automation and intellectualisation of customs administration in the Russian Federation have been proposed. In order to expand the coverage of the declaration array by automatic release technology, the main directions for improving the automation mechanism at the release of goods have been designated, trends of automation of customs operations and its influence on the development of foreign economic activity have been defined. The methodological basis of the study was fact-finding, analysis and synthesis, induction and deduction, system and process approaches, logical and statistical methods.

Sequent Systems without Improper Derivations

In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper, and others proper. Improper inference rules are more complicated and are often harder to understand than the proper ones. In the present paper, we distinguish between proper and improper derivations by using sequent systems. Specifically, we introduce a sequent system \(\vdash_{\bf Sc}\) for classical propositional logic with only structural rules, and prove that \(\vdash_{\bf Sc}\) does not allow improper derivations in general. For instance, the sequent \(\Rightarrow p \to q\) cannot be derived from the sequent \(p \Rightarrow q\) in \(\vdash_{\bf Sc}\). In order to prove the failure of improper derivations, we modify the usual notion of truth valuation, and using the modified valuation, we prove the completeness of \(\vdash_{\bf Sc}\). We also consider whether an improper derivation can be described generally by using \(\vdash_{\bf Sc}\).

The Rule of Existential Generalisation and Explicit Substitution

The present paper offers the rule of existential generalization (EG) that is uniformly applicable within extensional, intensional and hyperintensional contexts. In contradistinction to Quine and his followers, quantification into various modal contexts and some belief attitudes is possible without obstacles. The hyperintensional logic deployed in this paper incorporates explicit substitution and so the rule (EG) is fully specified inside the logic. The logic is equipped with a natural deduction system within which (EG) is derived from its rules for the existential quantifier, substitution and functional application. This shows that (EG) is not primitive, as often assumed even in advanced writings on natural deduction. Arguments involving existential generalisation are shown to be valid if the sequents containing their premises and conclusions are derivable using the rule (EG). The invalidity of arguments seemingly employing (EG) is explained with recourse to the definition of substitution.

Bilattice Logic for Rough Sets

Rough set theory is studied to manage uncertain and inconsistent information. Because Pawlak’s decision logic for rough sets is based on the classical two-valued logic, it is inconvenient for handling inconsistent information. We propose a bilattice logic as the deduction basis for the decision logic of rough sets to address inconsistent and ambiguous information. To enhance the decision logic to bilattice semantics, we introduce Variable Precision Rough Set (VPRS). As a deductive basis for bilattice decision logic, we define a consequence relation for Belnap’s four-valued semantics and provide a bilattice semantic tableau TB4 for a deduction system. We demonstrate the soundness and completeness of TB4 and enhance it with weak negation.

Natural Deduction System for the Logic of Binary Relations Based on the Algebraic Tradition

We present a proper natural deduction system (ND-system) for a logic of binary relations based on the algebraic tradition. Our system is an evolution from [W. W. Wadge. TCR 5, The University of Warwick, 1975]. We point out some aspects where Wadge's formalism fails as an ND-system and fix them all.

The subformula property of natural deduction derivations and analytic cuts

In derivations of a sequent system, $\mathcal{L}\mathcal{J}$, and a natural deduction system, $\mathcal{N}\mathcal{J}$, the trails of formulae and the subformula property based on these trails will be defined. The derivations of $\mathcal{N}\mathcal{J}$ and $\mathcal{L}\mathcal{J}$ will be connected by the map $g$, and it will be proved the following: an $\mathcal{N}\mathcal{J}$-derivation is normal $\Longleftrightarrow $ it has the subformula property based on trails $\Longleftrightarrow $ its $g$-image in $\mathcal{L}\mathcal{J}$ is without maximum cuts $\Longrightarrow $ that $g$-image has the subformula property based on trails. In $\mathcal{L}\mathcal{J}$-derivations, another type of cuts, sub-cuts, will be introduced, and it will be proved the following: all cuts of an $\mathcal{L}\mathcal{J}$-derivation are sub-cuts $\Longleftrightarrow $ it has the subformula property based on trails.

Labelled Natural Deduction for Public Announcement Logic with Common Knowledge

Public announcement logic is a logic that studies epistemic updates. In this paper, we propose a sound and complete labelled natural deduction system for public announcement logic with the common knowledge operator (PAC). The completeness of the proposed system is proved indirectly through a Hilbert calculus for PAC known to be complete and sound. We conclude with several discussions regarding the system including some problems of the system in attaining normalisation and subformula property.