Notre Dame Journal of Formal Logic · 1975 · 116 citations · 1 references
HumanitiesComputer ScienceMathematicsFormal MethodsLogicSet TheoryFormal SemanticsModal LogicModal TheoryModel TheoryNon-classical LogicCompletenessConstructive ProofsModal OperatorsNormal FormsOperators
There are two main methods of completeness proof in modal logic. One may use maximally consistent theories or their algebraic counterparts, on the one hand, or semantic tableaux and their variants, on the other hand. The former method is elegant but not constructive, the latter method is constructive but not elegant.
1
Rudolf Carnap · Journal of Symbolic Logic · 1946 · 273 citations