An `almost classical' period-based tense logic
Moving to a period based semantics, leaves us with at least two options for defining the truth of a negated sentences with respect to a formula. The homogeneous strong negation of a formula A - \(\neg A\)- has an intuitionistic flavour about it: \(\neg A\) is true at interval i iff A is not true at any subinterval of i. The weak negation of a formula A - \(\sim A\)- is entirely classical but heterogeneous. The truth of \(\sim A\) at an interval i does not preclude that A is true at a subinterval j of i. So the question arises, addressed by the author, whether there is a period based tense logic which has a classical negation with a homogeneous character. The author shows that the negation sought for can be defined relative to the standard topology of a Euclidean 1-space over a nondenumerable dense and continuous strict linear order. He proves soundness and completeness of the linear tense logic LinP-B with respect to the class of these models. To prove soundness, he shows that LinP-B is sound and complete with respect to a class of temporal algebras, and that each topological model is epimorphic to such a temporal algebra. To prove completeness, he first proves completeness with respect to denumerable linear Kripke models, and then goes on to show that each such model is equivalent to a Euclidean 1-space model.
- A note on the interpolation property in tense logic
- Generalized concepts of syntactically and semantically trivial differences and instant-based and period-based time ontologies
- Some System of Predicate Tense Logic
- scientific article; zbMATH DE number 1163393 (Why is no real title available?)
- In What Sense is J.N. Findlay the Founding Father of Tense-logic?
This page was built for publication: An `almost classical' period-based tense logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823925)
