Object

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.

Identifier:

oai:noad.sci.am:136157

DOI:

10.1109/CSITechnol.2013.6710335

ISBN:

978-1-4799-2460-8

Language:

English

URL:


Affiliation:

Institute of Informatics and Automation Problems

Country:

Armenia

Year:

2013

Time period:

23-27 September

Conference title:

Ninth International Conference on Computer Science and Information Technologies

Place:

Yerevan

Object collections:

Last modified:

Apr 19, 2021

In our library since:

Apr 19, 2021

Number of object content hits:

5

All available object's versions:

https://noad.sci.am/publication/149659

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information