Fuzzy logic with countable evaluated syntax revisited (Q878970)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fuzzy logic with countable evaluated syntax revisited
scientific article

    Statements

    Fuzzy logic with countable evaluated syntax revisited (English)
    0 references
    0 references
    4 May 2007
    0 references
    A fuzzy logic with evaluated syntax Ev\(_{\L}\) is investigated, where Ł is a standard Łukasiewicz algebra \(([0,1]\), \(\oplus\), \(\otimes\), \(\neg\), \(0,1)\). In this case, logical constants for all truth values from \([0,1]\) have to be introduced and the logical language becomes uncountable. In the paper the author presents Ev\(_{\L}\) with a countable language, where logical constants correspond to the set \(\mathbb Q\) of rational numbers from \([0,1]\). He then proves that classical completeness theory holds also for the countable logical language, i.e. if \(T\) is a fuzzy theory, \(A\) a formula and \(a\in [0,1]\), then \(T\vdash_a A\) iff \(T\models_a A\). The principal tool in the proof is a strengthening of the notion of complete theory. Namely, a fuzzy theory \(T\) is complete (in a new sense) if it is consistent and for every closed formula \(A\) and any \(a\in [0,1]\), \(T\vdash_a A\) implies that there is a set \(H_A\subseteq\mathbb Q\) such that \(\bigwedge H_A=a\) and \(T\vdash A\Rightarrow \mathbf b\) for every \(b\in H_A\), where \(\mathbf b\) is a logical constant corresponding to \(b\). It is proved that the classical notion of complete theory in Ev\(_{\L}\) follows from the new one.
    0 references
    0 references
    fuzzy logic
    0 references
    Łukasiewicz logic
    0 references
    evaluated syntax
    0 references
    0 references