Completeness

Maarten de Rijke, Yde VenemaCambridge 2001 · DOI · OpenAlex

Abstract

This chapter is about the completeness — and incompleteness — of normal modal logics. As we saw in Section 1.6, normal modal logics are collections of formulas satisfying certain simple closure conditions. They can be specified either syntactically or semantically, and this gives rise to the questions which dominate the chapter: Given a semantically specified logic, can we give it a syntactic characterization, and if so, how? And: Given a syntactically specified logic, can we give it a semantic characterization (and in particular, a characterization in terms of frames), and if so, how? To answer either type of question we need to know how to prove (soundness and) completeness theorems, and the bulk of the chapter is devoted to developing techniques for doing so.
BibTeX
@inproceedings{rijke2001completeness,
  author = {Maarten de Rijke and Yde Venema},
  title = {{Completeness}},
  booktitle = {Cambridge},
  year = {2001},
  doi = {10.1017/cbo9781107050884.005},
}

Loading related content...

Figure