Abstract
Abstract
A new characterization of tabularity in tense logic is established, namely, a tense logic L is tabular if and only if
$\mathsf {tab}_n^T\in L$
for some
$n\geq 1$
. Two characterization theorems for the Post-completeness in tabular tense logics are given. Furthermore, a characterization of the Post-completeness in the lattice of all tense logics is established. Post numbers of some tense logics are shown.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)