关于正与强正算术集的结构

2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI:10.1109/csitechnol.2017.8312130

S. Manukian

{"title":"关于正与强正算术集的结构","authors":"S. Manukian","doi":"10.1109/csitechnol.2017.8312130","DOIUrl":null,"url":null,"abstract":"The relations between the classes of positive and strongly positive arithmetical sets are investigated. Some simplified form for the logical representation of the class of positive sets is obtained. It is proved that the logical representation of the class of positive sets is obtained when the list of operations &, ∨ in the definition of the class of strongly positive sets is replaced by the list, ∃ &, ∨.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the structure of positive and strongly positive arithmetical sets\",\"authors\":\"S. Manukian\",\"doi\":\"10.1109/csitechnol.2017.8312130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relations between the classes of positive and strongly positive arithmetical sets are investigated. Some simplified form for the logical representation of the class of positive sets is obtained. It is proved that the logical representation of the class of positive sets is obtained when the list of operations &, ∨ in the definition of the class of strongly positive sets is replaced by the list, ∃ &, ∨.\",\"PeriodicalId\":332371,\"journal\":{\"name\":\"2017 Computer Science and Information Technologies (CSIT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Computer Science and Information Technologies (CSIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/csitechnol.2017.8312130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Computer Science and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/csitechnol.2017.8312130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了正、强正算术集类之间的关系。得到了一类正集合的逻辑表示形式的简化形式。证明了将强正集合定义中的操作列表&，∨替换为列表∃&，可以得到该类正集合的逻辑表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the structure of positive and strongly positive arithmetical sets

The relations between the classes of positive and strongly positive arithmetical sets are investigated. Some simplified form for the logical representation of the class of positive sets is obtained. It is proved that the logical representation of the class of positive sets is obtained when the list of operations &, ∨ in the definition of the class of strongly positive sets is replaced by the list, ∃ &, ∨.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 Computer Science and Information Technologies (CSIT)

自引率

0.00%

发文量