Fuzzy Logical Algebra and Study of the Effectiveness of Medications for COVID-19

A fuzzy logical algebra has diverse applications in various domains such as engineering, economics, environment, medicine, and so on. However, the existing techniques in algebra do not apply to delta-algebra. Therefore, the purpose of this paper was to investigate new types of cubic soft algebras and study their applications, the representation of cubic soft sets with δ-algebras, and new types of cubic soft algebras, such as cubic soft δ-subalgebra based on the parameter λ (λ-CSδ-SA) and cubic soft δ-subalgebra (CSδ-SA) over η. This study explains why the P-union is not really a soft cubic δ-subalgebra of two soft cubic δ-subalgebras. We also reveal that any R/P-cubic soft subsets of (CSδ-SA) is not necessarily (CSδ-SA). Furthermore, we present the required conditions to prove that the R-union of two members is (CSδ-SA) if each one of them is (CSδ-SA). To illustrate our assumptions, the proposed (CSδ-SA) is applied to study the effectiveness of medications for COVID-19 using the python program.

Multidimensional Model of Product Quality Formation

Based on the analysis of the functional capabilities of modern information systems, the paper substantiates the applicability of multidimensional combined information structures for computer-assistant planning in machinery production. A multidimensional optimization model has been developed for elementary technological surface-treatment routing in the case of using complex quality indicators determined by the operational properties of products. The dimensions of its coordinate space are determined by the number of technical constraints that govern the quality of the product. The paper provides an example of an algorithm that uses logical algebra operations to reduce the coordinate space of the model and to reduce the computational complexity of the design task.

PEIRCE’S CALCULI FOR CLASSICAL PROPOSITIONAL LOGIC

This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted byPC, is here presented as a sequent calculus and not as a natural deduction system. It is shown that Peirce’s aim was to presentPCas a sequent calculus. The law of distributivity, which Peirce states in 1880, is proved using Peirce’s Rule, which is a residuation, inPC. The transitional systems of the algebra of the copula that Peirce develops since 1880 paved the way to the 1896 graphical system of the alpha graphs. It is shown how the rules of the alpha system reinterpret Boolean algebras, answering Peirce’s statement that logical graphs supply a new system of fundamental assumptions to logical algebra. A proof-theoretic analysis is given for the connection betweenPCand the alpha system.