In this paper we examine different possibilities of defining reduced products and ultraproducts in fuzzy predicate logics. We present analogues to the Los Theorem for these notions and discuss the advantages and drawbacks of each definition introduced. Following the work in [De09], we show that these constructions are adequate for working in a reduced semantics.
Indexed by the Web of Science - with Conference Proceedings
Links:
[1] http://www.iiia.csic.es/en/individual/pilar-dellunde
[2] http://www.iiia.csic.es/en/publications/keyword/ultraproducts
[3] http://www.iiia.csic.es/en/publications/keyword/reduced products
[4] http://www.iiia.csic.es/en/publications/keyword/fuzzy predicate logics
[5] http://www.iiia.csic.es/en/publications/keyword/reduced semantics
[6] http://www.iiia.csic.es/en/publications/export/tagged/3815
[7] http://www.iiia.csic.es/en/publications/export/xml/3815
[8] http://www.iiia.csic.es/en/publications/export/bib/3815
[9] http://www.iiia.csic.es/en/project/arinf
[10] http://www.iiia.csic.es/en/project/at
[11] http://www.iiia.csic.es/en/project/locomotion-0