Some semantics of the predicate formulas in the framework of the symmetric constructive logic [1] is defined. The following theorems are proved: (1) any predicate formula deducible in the symmetric constructive predicate calculus is identically true in the sense of the introduced semantics; (2) some predicate formulas not deducible in the mentioned calculus are not identically true in the sense of this semantics.
oai:noad.sci.am:136157
10.1109/CSITechnol.2013.6710335
Institute of Informatics and Automation Problems
Ninth International Conference on Computer Science and Information Technologies
Apr 19, 2021
Apr 19, 2021
24
https://noad.sci.am/publication/149659