Soundness, Completeness, and Decidability for Propositional Modal Logic
Résumé de section
-
-
This is purely optional, but you can have a look if you are interested in the arguments for soundness, completeness and decidability of the tableaux method. A proof of completeness for the labelled natural deduction system is also given.
-
The full lecture notes in a compact presentation, including metatheorems and correspondence theory.
-