This book develops the theory of one of the most important notions in the methodology of formal systems. Particularly, completeness plays an important role in propositional logic where many variants of the notion have been defined. This approach allows also for a more profound view upon some essential properties of propositional systems. For these purposes, the theory of logical matrices, and the theory of consequence operations is exploited.
Table of ContentsBasic notions.- Semantic methods in propositional logic.- Completeness of propositional logics.- Characterizations of propositional connectives.