再论模糊谓词逻辑中的超积

2010 40th IEEE International Symposium on Multiple-Valued Logic Pub Date : 2010-05-26 DOI:10.1109/ISMVL.2010.33

Pilar Dellunde

{"title":"再论模糊谓词逻辑中的超积","authors":"Pilar Dellunde","doi":"10.1109/ISMVL.2010.33","DOIUrl":null,"url":null,"abstract":"In this paper we examine different possibilities of defining reduced products and ultraproducts in fuzzy predicate logics. We present analogues to the $\\L$os Theorem for these notions and discuss the advantages and drawbacks of each definition introduced. Following the work in \\cite{De09}, we show that these constructions are adequate for working in a reduced semantics","PeriodicalId":447743,"journal":{"name":"2010 40th IEEE International Symposium on Multiple-Valued Logic","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Revisiting Ultraproducts in Fuzzy Predicate Logics\",\"authors\":\"Pilar Dellunde\",\"doi\":\"10.1109/ISMVL.2010.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we examine different possibilities of defining reduced products and ultraproducts in fuzzy predicate logics. We present analogues to the $\\\\L$os Theorem for these notions and discuss the advantages and drawbacks of each definition introduced. Following the work in \\\\cite{De09}, we show that these constructions are adequate for working in a reduced semantics\",\"PeriodicalId\":447743,\"journal\":{\"name\":\"2010 40th IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 40th IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2010.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 40th IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2010.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文研究了模糊谓词逻辑中定义约简积和超积的不同可能性。我们为这些概念提供了$\L$ os定理的类似物，并讨论了所引入的每个定义的优点和缺点。在\cite{De09}中的工作之后，我们将展示这些结构足以在简化的语义中工作

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

查看原文本刊更多论文

Revisiting Ultraproducts in Fuzzy Predicate Logics

In this paper we examine different possibilities of defining reduced products and ultraproducts in fuzzy predicate logics. We present analogues to the $\L$os Theorem for these notions and discuss the advantages and drawbacks of each definition introduced. Following the work in \cite{De09}, we show that these constructions are adequate for working in a reduced semantics

求助全文

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

来源期刊

2010 40th IEEE International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量