{"title":"模糊构造逻辑的功能系统","authors":"I. Zaslavsky","doi":"10.1109/CSITECHNOL.2017.8312135","DOIUrl":null,"url":null,"abstract":"The principles of constructive mathematics are applied to the fuzzy constructive logic. The preceding results of the author in fuzzy constructive logic are generalized for predicate formulas including (in general) functional symbols and symbols of constants. The constructive (intuitionistic) predicate calculus on the base of such formulas is considered; it is denoted by H(fcon). The notion of identically f-true predicate formula is introduced. It is proved that any predicate formula deducible in H(fcon) is identically f-true.","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":"0","resultStr":"{\"title\":\"Functional system of the fuzzy constructive logic\",\"authors\":\"I. Zaslavsky\",\"doi\":\"10.1109/CSITECHNOL.2017.8312135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The principles of constructive mathematics are applied to the fuzzy constructive logic. The preceding results of the author in fuzzy constructive logic are generalized for predicate formulas including (in general) functional symbols and symbols of constants. The constructive (intuitionistic) predicate calculus on the base of such formulas is considered; it is denoted by H(fcon). The notion of identically f-true predicate formula is introduced. It is proved that any predicate formula deducible in H(fcon) is identically f-true.\",\"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\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Computer Science and Information Technologies (CSIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSITECHNOL.2017.8312135\",\"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.8312135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The principles of constructive mathematics are applied to the fuzzy constructive logic. The preceding results of the author in fuzzy constructive logic are generalized for predicate formulas including (in general) functional symbols and symbols of constants. The constructive (intuitionistic) predicate calculus on the base of such formulas is considered; it is denoted by H(fcon). The notion of identically f-true predicate formula is introduced. It is proved that any predicate formula deducible in H(fcon) is identically f-true.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
