Calendar Logic

From MaRDI portal





The main distinction of Calendar Logic (CL) from standard temporal logics consists in the property that ``the temporal operators [of the former] are always finite sets of finite intervals. Therefore, a translation into a decidable system (here: classical propositional logic) is possible. The language of CL, its syntax and semantics are defined and the translation algorithms into propositional logic are described; then soundness and completeness of the translation are proved. Finally a tableau system for CL is described and its soundness and completeness are proved. This last point is not clear, since the formulations of soundness and completeness seem to be confused: what is called soundness is completeness and vice versa.











This page was built for publication: Calendar Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236069)