BL (logic)

Basic fuzzy Logic (or shortly BL), the logic of continuous t-norms, is one of t-norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices;[1] it extends the logic of all left-continuous t-norms MTL.

Syntax

Language

The language of the propositional logic BL consists of countably many propositional variables and the following primitive logical connectives:

The following are the most common defined logical connectives:

A \wedge B \equiv A \otimes (A \rightarrow B)
\neg A \equiv A \rightarrow \bot
A \leftrightarrow B \equiv (A \rightarrow B) \wedge (B \rightarrow A)
As in MTL, the definition is equivalent to (A \rightarrow B) \otimes (B \rightarrow A).
A \vee B \equiv ((A \rightarrow B) \rightarrow B) \wedge ((B \rightarrow A) \rightarrow A)
\top \equiv \bot \rightarrow \bot

Well-formed formulae of BL are defined as usual in propositional logics. In order to save parentheses, it is common to use the following order of precedence:

Axioms

A Hilbert-style deduction system for BL has been introduced by Petr Hájek (1998). Its single derivation rule is modus ponens:

from A and A \rightarrow B derive B.

The following are its axiom schemata:

\begin{array}{ll}
  {\rm (BL1)}\colon & (A \rightarrow B) \rightarrow ((B \rightarrow C) \rightarrow (A \rightarrow C)) \\
  {\rm (BL2)}\colon & A \otimes B \rightarrow A\\
  {\rm (BL3)}\colon & A \otimes B \rightarrow B \otimes A\\
  {\rm (BL4)}\colon &  A \otimes (A \rightarrow B) \rightarrow B \otimes (B \rightarrow A)\\
  {\rm (BL5a)}\colon &  (A \rightarrow (B \rightarrow C)) \rightarrow (A \otimes B \rightarrow C)\\
  {\rm (BL5b)}\colon &  (A \otimes B \rightarrow C) \rightarrow (A \rightarrow (B \rightarrow C))\\
  {\rm (BL6)}\colon &  ((A \rightarrow B) \rightarrow C) \rightarrow (((B \rightarrow A) \rightarrow C) \rightarrow C)\\
  {\rm (BL7)}\colon &  \bot \rightarrow A
\end{array}

The axioms (BL2) and (BL3) of the original axiomatic system were shown to be redundant (Chvalovský, 2012) and (Cintula, 2005). All the other axioms were shown to be independent (Chvalovský, 2012).

Semantics

Like in other propositional t-norm fuzzy logics, algebraic semantics is predominantly used for BL, with three main classes of algebras with respect to which the logic is complete:

Bibliography

References

  1. Ono (2003).
This article is issued from Wikipedia - version of the Sunday, April 27, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.