structure for 'Formal Logic'    |     alphabetical list of themes    |     unexpand these ideas

4. Formal Logic / B. Propositional Logic PL / 5. Completeness of PL

[there is a proof for every valid formula]

1 idea
Propositional logic is complete, since all of its tautologous sequents are derivable [Lemmon]
     Full Idea: A logical system is complete is all expressions of a specified kind are derivable in it. If we specify tautologous sequent-expressions, then propositional logic is complete, because we can show that all tautologous sequents are derivable.
     From: E.J. Lemmon (Beginning Logic [1965], 2.5)
     A reaction: [See Lemmon 2.5 for details of the proofs]