Minimally incomplete sets of Łukasiewiczian truth functions (Q796515)

From MaRDI portal
Revision as of 19:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimally incomplete sets of Łukasiewiczian truth functions
scientific article

    Statements

    Minimally incomplete sets of Łukasiewiczian truth functions (English)
    0 references
    0 references
    1983
    0 references
    An n-valued truth function is called pure if it is closed on the set \(\{1,n\}\). And, if it can be defined by composition from \(\neg\) and \(\to\), it is said to be Łukasiewiczian or an Ł\(_ n-function\). The author shows the following equivalences for \(n>2:\) a) n-1 is prime; b) the set of Ł\(_ n-functions\) coincides with the set of pure n-valued functions; c) \(\{ \neg,\to,f\}\) is functionally complete if f is non- Łukasiewiczian.
    0 references
    0 references
    minimally incomplete sets of Łukasiewiczian truth functions
    0 references
    functional completeness
    0 references
    n-valued truth function
    0 references
    0 references