Expressiveness and Completeness of an Interval Tense Logic

@article{Venema1990ExpressivenessAC,
  title={Expressiveness and Completeness of an Interval Tense Logic},
  author={Yde Venema},
  journal={Notre Dame J. Formal Log.},
  year={1990},
  volume={31},
  pages={529-547}
}
  • Y. Venema
  • Published 19 September 1990
  • Computer Science
  • Notre Dame J. Formal Log.
We present the syntax and semantics of an interval-based temporal logic which was defined by Halpern and Shoham. It is proved that this logic has a greater capacity to distinguish frames than any temporal logic based on points and we show that neither this nor any other finite set of operators can be functionally complete on the class of dense orders. In the last part of the paper we give sound and complete sets of axioms for several classes of structures. The methods employed in the paper show… 

Figures from this paper

Expressiveness of the Interval Logics of Allen's Relations on the Class of All Linear Orders: Complete Classification
TLDR
A complete set of inter-definability equations between these modal operators associated with Allen's relations between intervals in linear orders is established, and a complete classification of the family of 212 fragments of HS with respect to their expressiveness is obtained.
Interval Temporal Logics over Finite Linear Orders: the Complete Picture
TLDR
This paper identifies all fragments of Halpern and Shoham's interval temporal logic HS whose finite satisfiability problem is decidable, and classifies them in terms of both relative expressive power and complexity.
On the Expressive Power of First Order-Logic Extended with Allen's Relations in the Strict Case
We consider the languages of first order-logic (with equality) extended with Allen's relations for temporal intervals. We give a complete classification of such languages in terms of relative
The Light Side of Interval Temporal Logic: The Bernays-Schönfinkel's Fragment of CDT
TLDR
This paper takes the most expressive interval temporal logic studied so far, namely, Venema's CDT, and suitably limit the nesting degree of modalities, and shows that such a fragment is in fact NP-complete (theBernays-Sch¨onfinkel's class is NEXPTIME-complete), and that any natural extension of it is undecidable.
Completeness of Chop
TLDR
This paper shows that the logic C is sound and complete, which can be also viewed as the proper fragment of CDT with only chop plus the modal constant for point-intervals.
A New Modal Approach to the Logic of Intervals
TLDR
A interval temporal logic with two binary relations, precedence and inclusion, and it is proved that the logic of minimal interval structures is complete and decidable, possessing the finite model property, and that the satisfiability problem is PSPACEcomplete.
On Begins, Meets and before
TLDR
This paper provides an optimal non-deterministic decision procedure, and shows that the language is powerful enough to polynomially encode metric constraints on the length of the current interval.
On coarser interval temporal logics
Computational Complexity of a Core Fragment of Halpern-Shoham Logic
TLDR
It is proved that by adding nominals and satisfaction operators to the fragment the authors reach NPcompleteness whenever the timeline is dense or the interpretation of modal operators is weakened (excluding the case when punctual intervals are disallowed and the Timeline is discrete).
...
...

References

SHOWING 1-10 OF 17 REFERENCES
EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC
TLDR
A propositional language with atomic propositions p, q, r, . . . the usual classical connectives ∼,∧,∨ → and some additional connectives denoted by various symbols such as |=, , etc is considered.
A propositional modal logic of time intervals
In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this
Definability with Bounded Number of Bound Variables
An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames
To fix our notation, (S,R,g) denotes a propositional Kripke frame with relation R ⊆ S 2, and an assignment g, (i.e. g(p) ⊆ S, for atom p).
A conjectured axiomatization of two-dimensional Reichenbachian tense logic
The present paper has grown out of a need for improved understanding of the technical aspects of the systems of tense logic that have been proposed and applied by Stuttgart people like Franz
Intervals and tenses
TLDR
The intriguing suggestion of Finkelstein that “category theory is to metaphysics what group theory isto physics” deserves serious consideration.
The monadic second order theory of all countable ordinals
The monadic second order theory of ?1.- Axiomatization of the monadic second order theory of ?1.
The Correspondence Theory
Basic Tense Logic
...
...