Abstract

Analytic tableau systems for the family of non-deterministic semantics are introduced. These are based on tableaux for many-valued logics using sets-as-signs DNF representations. Karnaugh maps illustrate the construction of tableau rules. In contrast to classical many-valued tableaux, we add a rule called sign intersection. Soundness and completeness are shown. As an example demonstrates, some tableau systems would be incomplete without sign intersection. There is a correspondence to well-studied canonical calculi based on sequent systems: Tableau systems can be translated into canonical calculi, but not vice-versa (structural rules are missing on the tableau side).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.