On the logical semantics of the symmetric constructive logic based on the properties of recursively enumerable sets

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.