Post Completeness in Modal Logic

  title={Post Completeness in Modal Logic},
  author={Krister Segerberg},
  journal={J. Symb. Log.},
Let ⊥, →, and □ be primitive, and let us have a countable supply of propositional letters. By a ( modal) logic we understand a proper subset of the set of all formulas containing every tautology and being closed under modus ponens and substitution. A logic is regular if it contains every instance of □A ∧ □B ↔ □(A ∧ B) and is closed under the rule A regular logic is normal if it contains □⊤. The smallest regular logic we denote by C (the same as Lemmon's C2 ), the smallest normal one by K . If L… CONTINUE READING

Similar Papers

Topics from this paper.