RUS  ENG
Full version
JOURNALS // Program Systems: Theory and Applications // Archive

Program Systems: Theory and Applications, 2017 Volume 8, Issue 2, Pages 69–93 (Mi ps263)

This article is cited 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.

UDC: 519.766.2

Received: 26.03.2017
Accepted: 05.06.2017

DOI: 10.25209/2079-3316-2017-8-2-69-93



© Steklov Math. Inst. of RAS, 2025