@inproceedings{ef7c6cf9f45c4b4ebd28a649e6b01db0,
title = "On the logical semantics of the symmetric constructive logic based on the properties of recursively enumerable sets",
abstract = "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.",
keywords = "RED-ideal, RES-ideal, Symmetric constructive logic, predicate calculus, predicate formula, recursively enumerable set",
author = "Zaslavsky, \{Igor D.\}",
year = "2013",
month = jan,
day = "1",
doi = "10.1109/CSITechnol.2013.6710335",
language = "English",
isbn = "9781479924615",
series = "CSIT 2013 - 9th International Conference on Computer Science and Information Technologies, Revised Selected Papers",
publisher = "Institute of Electrical and Electronics Engineers",
booktitle = "CSIT 2013 - 9th International Conference on Computer Science and Information Technologies, Revised Selected Papers",
address = "United States",
note = "9th International Conference on Computer Science and Information Technologies, CSIT 2013 ; Conference date: 23-09-2013 Through 27-09-2013",
}