Hostname: page-component-6587cd75c8-cpvbf Total loading time: 0 Render date: 2025-04-24T06:31:15.220Z Has data issue: false hasContentIssue false
  • English
  • Français

TABULARITY AND POST-COMPLETENESS IN TENSE LOGIC

Part of: General logic

Published online by Cambridge University Press:  07 April 2022

QIAN CHEN  and
MINGHUI MA
QIAN CHEN
Affiliation:
TSINGHUA-AMSTERDAM JOINT RESEARCH CENTRE FOR LOGIC DEPARTMENT OF PHILOSOPHY TSINGHUA UNIVERSITY NO. 1 QINGHUA YUAN, HAIDIAN DISTRICT BEIJING 100084, CHINA E-mail: [email protected]
MINGHUI MA*
Affiliation:
INSTITUTE OF LOGIC AND COGNITION DEPARTMENT OF PHILOSOPHY SUN YAT-SEN UNIVERSITY NO. 135 XINGANG XI ROAD, HAIZHU DISTRICT GUANGZHOU 510275, CHINA
*
E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

Tense logictabularitypost-completeness

MSC classification

Primary: 03B44: Temporal logic
Secondary: 03B45: Modal logic (including the logic of norms)
Type
Research Article
Information
The Review of Symbolic Logic , Volume 17 , Issue 2 , June 2024 , pp. 475 - 492
Check for updates
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

BIBLIOGRAPHY

Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal Logic. New York: Cambridge University Press.CrossRefGoogle Scholar
Blok, W. (1980). Pretabular varieties of modal algebras. Studia Logica, 39, 101–124.CrossRefGoogle Scholar
Chagrov, A. & Shehtman, V. (1995). Algorithmic aspects of propositional tense logics. In Pacholski, L. and Tiuryn, J., editors. Computer Science Logic. Berlin–Heidelberg: Springer, pp. 442–455.CrossRefGoogle Scholar
Chagrov, A. & Zakharyaschev, M. (1997). Modal Logic. New York: Oxford University Press.CrossRefGoogle Scholar
Fritz, P. (2016). Post completeness in congruential modal logics. In Beklemishev, L., Demri, S., and Máté, A., editors. Advances in Modal Logic, Vol. 11. London: College Publications, pp. 288–301.Google Scholar
Grefe, C. (1994). Modale Logiken funktionaler Frames. Master’s Thesis, FU Berlin.Google Scholar
Kracht, M. (1992). Even more about the lattice of tense logics. Archive for Mathematical Logic, 31(4), 243–257.CrossRefGoogle Scholar
Kracht, M. (1997). Tools and Techniques in Modal Logic. Amsterdam: Elsevier.Google Scholar
Ma, M. & Chen, Q. (2021). Lattices of finitely alternative normal tense logics. Studia Logica, 109, 1093–1118.CrossRefGoogle Scholar
Makinson, D. (1971). Some embedding theorems for modal logic. Notre Dame Journal of Formal Logic, 12(2), 252–254.CrossRefGoogle Scholar
Makinson, D. & Segerberg, K. (1974). Post completeness and ultrafilters. Mathematical Logic Quarterly, 20(25–27), 385–388.CrossRefGoogle Scholar
Maksimova, L. (1975). Pretabular extensions of Lewis S4. Algebra and Logic, 14, 16–33.CrossRefGoogle Scholar
Rautenberg, W. (1979). More about the lattice of tense logic. Bulletin of the Section of Logic, 8, 21–25.Google Scholar
Segerberg, K. (1972). Post completeness in modal logic. Journal of Symbolic Logic, 37(4), 711–715.CrossRefGoogle Scholar
Segerberg, K. (1976). The truth about some Post numbers. Journal of Symbolic Logic, 41(1), 239–244.CrossRefGoogle Scholar
Thomason, S. K. (1972). Semantical analysis of tense logic. Journal of Symbolic Logic, 37(1), 150–158.CrossRefGoogle Scholar
Wolter, F. (1993). Lattices of modal logics. Ph.D. Thesis, Freien Universität Berlin.Google Scholar
Wolter, F. (1995). The finite model property in tense logic. Journal of Symbolic Logic, 60(3), 757–774.CrossRefGoogle Scholar
Wolter, F. (1996). A counterexample in tense logic. Notre Dame Journal of Formal Logic, 37(2), 167–173.CrossRefGoogle Scholar
Wolter, F. (1996). Properties of tense logics. Mathematical Logic Quarterly, 42, 481–500.CrossRefGoogle Scholar
Wolter, F. (1996). Tense logic without tense operators. Mathematical Logic Quarterly, 42, 145–171.CrossRefGoogle Scholar
Wolter, F. (1997). Completeness and decidability of tense logics closely related to logics above K4. Journal of Symbolic Logic, 62, 131–159.CrossRefGoogle Scholar
Wolter, F. (1997). The structure of lattices of subframe logics. Annals of Pure and Applied Logic, 86(13), 47–100.CrossRefGoogle Scholar
Wolter, F. & Zakharyaschev, M. (2007). Modal decision problems. In Blackburn, P., van Benthem, J., and Wolter, F., editors. Handbook of Modal Logic. Amsterdam: Elsevier, pp. 427–489.CrossRefGoogle Scholar
Zakharyaschev, M., Wolter, F., & Chagrov, A. (2001). Advanced modal logic. In Gabbay, D., and Guenthner, F., editors. Handbook of Philosophical Logic, Vol. 3. Dordrecht: Kluwer Academic, pp. 83–266.CrossRefGoogle Scholar