Strong non-standard completeness for fuzzy logics

In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ultraproduct. Roughly speaking, to say that a logic C is strong non-standard complete means that, for any countable theory over C and any formula such that C , there exists an evaluation e of C-formulas into a C-algebra A such that the universe of A is a non-Archimedean extension [0, 1] of the real unit interval [0, 1], e

• Type: Journal
• Year: 2008
• Where: SOCO
• Authors: Tommaso Flaminio
• Keywords: Fuzzy Logics, Non-standard, SOCO 2008, Software Engineering, Strong Non-standard Completeness