NH - Paraconsistent Hybrid Logic
is a three-valued predicate logic with values T, F, and B. It is the glutty dual of .
Semantics
Truth Values
Common labels for the values include:
T |
1 |
just true |
B |
0.5 |
both true and false |
F |
0 |
just false |
Designated Values
The set of designated values for is: { T, B }
Truth Tables
The value of a sentence with a truth-functional operator is determined by the values of its operands according to the following tables.
| Negation | |||
|---|---|---|---|
| ¬ | |||
| T | F | ||
| B | B | ||
| F | T | ||
| Conjunction | |||
|---|---|---|---|
| ∧ | T | B | F |
| T | T | B | F |
| B | B | T | F |
| F | F | F | F |
| Disjunction | |||
|---|---|---|---|
| ∨ | T | B | F |
| T | T | T | T |
| B | T | B | B |
| F | T | B | F |
| Conditional | |||
|---|---|---|---|
| → | T | B | F |
| T | T | T | F |
| B | T | T | F |
| F | T | T | T |
Defined Operators
The Biconditional ↔, in turn, is defined in the usual way:
| Biconditional | |||
|---|---|---|---|
| ↔ | T | B | F |
| T | T | T | F |
| B | T | T | F |
| F | F | F | T |
The Material Conditional ⊃ is definable in terms of disjunction:
Likewise the Material Biconditional ≡ is defined in terms of ⊃ and ∧:
| Material Conditional | |||
|---|---|---|---|
| ⊃ | T | B | F |
| T | T | B | F |
| B | T | B | B |
| F | T | T | T |
| Material Biconditional | |||
|---|---|---|---|
| ≡ | T | B | F |
| T | T | B | F |
| B | B | T | B |
| F | F | B | T |
Compatibility Tables
does not have a separate Assertion operator, but we include a table and rules for it, for cross-compatibility.
| Assertion | |||
|---|---|---|---|
| ⚬ | |||
| T | T | ||
| B | B | ||
| F | F | ||
Predication
A sentence with predicate P with parameters is assigned a value as follows:
- T iff is in the extension of P and not in the
anti-extension of P.
- F iff is in the anti-extension of P and not
in the extension of P.
- B iff is in both the extension and anti-extension
of P.
Consequence
Logical Consequence is defined in terms of the set of designated values { T, B }:
Logical Consequence
C is a Logical Consequence of A iff all models where A has a desginated value are models where C also has a designated value.
Tableaux
tableaux are built similary to .
Nodes
Nodes for many-value tableaux consiste of a sentence plus a designation marker: ⊕ for designated, and ⊖ for undesignated.
Trunk
To build the trunk for an argument, add a designated node for each premise, and an undesignated node for the conclusion.
Closure
Rules
In general, rules for connectives consist of four rules per connective: a designated rule, an undesignated rule, a negated designated rule, and a negated undesignated rule. The special case of negation has a total of two rules which apply to double negation only, one designated rule, and one undesignated rule.
Operator Rules
¬ Rules
∧ Rules
∨ Rules
⊃ Rules
≡ Rules
→ Rules
↔ Rules
Compatibility Rules
⚬ Rules
Notes
References
Colin Caret. (2017). Hybridized Paracomplete and Paraconsistent Logics. The Australasian Journal of Logic, 14.