How to Avoid Deviance (in Logic)
The `deviance' in logic addressed here is limited to 3-valued logics with a normal negation, such as Łukasiewicz's L\(_3\), Kleene's (strong) K\(_3\), or Bochvar's (internal) B\(_3\), which reject the formula \(p\) \(\vee\!\sim\! p\). These are motivated as logics for future contingencies, decidability, and meaninglessness, respectively. The authors maintain that, even with such motivation, this deviance from classical 2-valued logic (CL) is unnecessary. On the one hand, all of CL can be found in the 3-valued logics if they (are extended to) contain an operator \(A\) for determinateness, such that each formula of CL is translated by the result of prefixing each atom by \(A\). Then the 3-valued logics even contain the law of the excluded middle, in the form \(Ap\) \(\vee\!\sim\!\! Ap\). On the other hand, the authors maintain, each 3-valued logic can be viewed as a 2-valued extension of CL that contains a modal operator, \(\square\), where \(\square p\) is interpreted as saying that \(p\) takes the value \(T\) in the 3-valued system, \(\square\!\sim\! p\) as saying that \(p\) takes the value \(F\), and \(\sim\!\square p\,\&\!\sim\!\square\!\sim\! p\) as saying that \(p\) takes the value \(I\). \(\square\) is then governed by appropriate axioms corresponding to the different 3-valued systems. With \(\square\), the authors say, anything that can be expressed in the 3-valued logic can be expressed in such an extended 2-valued system. It is not clear what this claim comes to, however, since no translation function for formulas is proposed. Throughout the discussion, although there are heuristic arguments for the claims made, no proofs are given. Here logics are always identified as sets of logical truths, rather than by consequence relations. (Of course, K\(_3\) and B\(_3\) have no logical truths).
This page was built for publication: How to Avoid Deviance (in Logic)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706127)