DocumentCode
673058
Title
On the logical semantics of the symmetric constructive logic based on the properties of recursively enumerable sets
Author
Zaslavsky, Igor D.
Author_Institution
Inst. of Inf. & Autom. Problems, Yerevan, Armenia
fYear
2013
fDate
23-27 Sept. 2013
Firstpage
1
Lastpage
6
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
formal logic; logical semantics; predicate formula semantics; recursively enumerable set properties; symmetric constructive logic; symmetric constructive predicate calculus; Calculus; Computer science; Conferences; Indexes; Information technology; Materials; Semantics; RED-ideal; RES-ideal; Symmetric constructive logic; predicate calculus; predicate formula; recursively enumerable set;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technologies (CSIT), 2013
Conference_Location
Yerevan
Print_ISBN
978-1-4799-2460-8
Type
conf
DOI
10.1109/CSITechnol.2013.6710335
Filename
6710335
Link To Document