*** Welcome to piglix ***

Łukasiewicz–Tarski logic


In mathematics, Łukasiewicz logic (/lkəˈʃɛvɪ/; Polish pronunciation: [wukaˈɕɛvʲitʂ]) is a non-classical, many valued logic. It was originally defined in the early 20th century by Jan Łukasiewicz as a three-valued logic; it was later generalized to n-valued (for all finite n) as well as infinitely-many-valued (ℵ0-valued) variants, both propositional and first-order. The ℵ0-valued version was published in 1930 by Łukasiewicz and Alfred Tarski; consequently it is sometimes called the Łukasiewicz-Tarski logic. It belongs to the classes of t-norm fuzzy logics and substructural logics.

This article presents the Łukasiewicz[-Tarski] logic in its full generality, i.e. as an infinite-valued logic. For an elementary introduction to the three-valued instantiation Ł3, see three-valued logic.

The propositional connectives of Łukasiewicz logic are implication , negation , equivalence , weak conjunction , strong conjunction , weak disjunction , strong disjunction , and propositional constants and . The presence of conjunction and disjunction is a common feature of substructural logics without the rule of contraction, to which Łukasiewicz logic belongs.


...
Wikipedia

...