In this paper we give an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t , ⊧ f , ⊧ i , and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six.
|Number of pages||16|
|Journal||Journal of philosophical logic|
|Early online date||4 Dec 2014|
|Publication status||Published - 2014|
- Trilattice SIXTEEN 3; Tableau calculi; Functional completeness; Truth entailment; Falsity entailment; Information entailment