Program Systems: Theory and Applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Program Systems: Theory and Applications:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Program Systems: Theory and Applications, 2017, Volume 8, Issue 2, Pages 69–93
DOI: https://doi.org/10.25209/2079-3316-2017-8-2-69-93
(Mi ps263)
 

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
Full-text PDF (911 kB) Citations (3)
References:
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
Document Type: Article
UDC: 519.766.2
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Sme17}
\by Yu.~M.~Smetanin
\paper Verification of logical consequence, using the calculus of constituent sets and correspondences of Galois
\jour Program Systems: Theory and Applications
\yr 2017
\vol 8
\issue 2
\pages 69--93
\mathnet{http://mi.mathnet.ru/ps263}
\crossref{https://doi.org/10.25209/2079-3316-2017-8-2-69-93}
Linking options:
  • https://www.mathnet.ru/eng/ps263
  • https://www.mathnet.ru/eng/ps/v8/i2/p69
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Program Systems: Theory and Applications
    Statistics & downloads:
    Abstract page:181
    Full-text PDF :59
    References:39
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025