|
This article is cited in 3 scientific papers (total in 3 papers)
Mathematical Foundations of Programming
Verification of logical consequence, using the calculus of constituent sets and correspondences of Galois
Yu. M. Smetanin Udmurt State University
Abstract:
The paper substantiates that, in the case where staged
argument uses the concept of verification tasks of conformity can be checked logical consequence, without applying the logical conclusion. It is convenient to use the calculus of constituent sets and tasking logic ${L_{{s_2}}}$ [bib:Sme16a,bib:Sme3].
The example shows that the predicate logic, logical consequence verification can be performed using a simple reasoning based on Galois correspondence.
(In Russian).
Key words and phrases:
logical equations, syllogistic, algebraic ontology, algebraic system, nonparadoxical logical consequence, Boolean algebra, Galois correspondence.
Received: 26.03.2017 Accepted: 05.06.2017
Citation:
Yu. M. Smetanin, “Verification of logical consequence, using the calculus of constituent sets and correspondences of Galois”, Program Systems: Theory and Applications, 8:2 (2017), 69–93
Linking options:
https://www.mathnet.ru/eng/ps263 https://www.mathnet.ru/eng/ps/v8/i2/p69
|
Statistics & downloads: |
Abstract page: | 181 | Full-text PDF : | 59 | References: | 39 |
|