Non-finite methods of Reconstructions of Non-Classical Propositional Logic Variants based on the Theory of Structures in Control Problems of Complex Systems

The report explores the problem of developing a common base of mathematical support for the problem of modeling control systems for objects of great complexity. The problem of reconstructing variants of propositional logic based on structures whose elements are considered as truth values of formulas...

Full description

Saved in:
Bibliographic Details
Published in:2022 15th International Conference Management of large-scale system development (MLSD) pp. 1 - 4
Main Author: Titov, Andery V.
Format: Conference Proceeding
Language:English
Published: IEEE 26.09.2022
Subjects:
Algebra
Boolean lattices
Brauer algeura
homomorphism
implicative lattices
lattices
Linguistics
mathematical structures
paraconsistent logics
Predictive models
Process control
propositional logic
pseudo-Boolean algebra
Reliability theory
Search problems
Semantics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The report explores the problem of developing a common base of mathematical support for the problem of modeling control systems for objects of great complexity. The problem of reconstructing variants of propositional logic based on structures whose elements are considered as truth values of formulas of reconstructed variants of propositional logic is considered. The reconstruction is based on the assumption that there is a homomorphism from the algebra of logic to the algebra of truth values. In the proposed version of the semantic approach to the classification of formal logical calculus as a result of the interaction of various logical moments, this interaction takes the form of an interconnection of algebraic structures on which the values of "judgments" take values, different types of measures on these structures and equivalence relations associated with them.
DOI:10.1109/MLSD55143.2022.9934565