Abstract

The paper expands upon the work by Wang [4], who proposes a new framework based on quantifier-free predicate language extended by a new modality ∃x□\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists x\Box $$\end{document} and axiomatizes the logic over S5 frames. This paper gives the logics over K, D, T, 4, S4 frames with increasing and constant domains. And we provide a general strategy for proving completeness theorems for logics w.r.t. the increasing domain and logics w.r.t. the constant domain respectively.