Denumerably many Post-complete normal modal logics with propositional constants (Q691130): Difference between revisions

This short paper provides further evidence for the fact that the phenomenon of Post-completeness is quite sensitive to the changes in the language. A logic is Post-complete if it is consistent and has no proper consistent extension. It is well known that in the lattice of monomodal normal logics there are only two Post-complete logics. On the other hand, Williamson proved that in the lattice of bimodal normal logics we have a continuum of such logics. Here, the author investigates monomodal normal logics but with additional propositional constant \(\kappa \). Specifically, he considers the logics of point-generated frames \(L_n = \langle W_n, R_n, C_n \rangle\), where \(W_n := \{0, 1, ..., n, n+1\}\), \(R_n := \{\langle n+1, 0\rangle\}\cup \{\langle i, j\rangle : j =i+1\}\) and \(C_n := \{0\}\). \(C_n\) is a special parameter introduced for valuation \(\kappa \), i.e., \(\kappa \) holds in \(w\) iff \(w\in C_n\). It is shown that every such frame defines a different Post-complete logic, hence we have at least denumerably many Post-complete monomodal logics in the language with \(\kappa \) all being extensions of \textbf{KD!}. Finally, it is noted that this result may be strengthened to the effect that there is a continuum of Post-complete modal logics in the language with \(\kappa \). This was independently reported to the author by R. Goldblatt, T. Kowalski and the anonymous referee.