3 papers
cs.LO2026
Most Properties are Undecidable for Transitive Tense Logics
Qian Chen, Tenyo Takahashi
A logics' property is decidable in a class of logics if there exists an algorithm that decides whether a finitely axiomatizable logic in the class has the property. Many properties…
math.LO2025
Pretabular Tense Logics over S4t
Qian Chen
A logic is called tabular if it is the logic of some finite frame and is pretabular if it is not tabular while all of its proper consistent extensions are tabular. In this…
math.LO2025
Degree of Kripke-incompleteness of Tense Logics
Qian Chen
The degree of Kripke-incompleteness of a logic in some lattice of logics is the cardinality of logics in which share the same class of Kripke-frames…