We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.

Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of these temporal logics. We show how to incorporate in the systems (...) various relations between intervals and/or various time orderings. (shrink)

This paper presents a new kind of interpolation theorems about Neighbourhood Logic and Interval Temporal Logic . Unlike Craig interpolation, which holds for these logics too, the new theorems treat the existence of interpolants which specify properties of selected intervals in the models of NL and ITL.

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial (...) orders (\nsbcdt\ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

Interval Temporal Logic is a finite-time linear temporal logic with applications in hardware verification, temporal logic programming and specification of multimedia documents. Due to the logic's non-elementary complexity, efficient ITL-based verification tools have been difficult to develop, even for propositional subsets. MONA is an efficient implementation of an automata-based decision procedure for the logic WS1S. Despite the non-elementary complexity of WS1S, MONA has been successfully applied in problems such as hardware synthesis, (...) protocol verification and theorem proving. Here we consider a rich propositional subset of ITL, PITL, whose expressive power is equivalent to that of WS1S, and in turn to that of regular languages. PITL not only includes operators such as chop, star and projection, but also past operators such as previous, chop in the past and since. We provide an interpretation of PITL formulas in WS1S, which led us to a direct translation from PITL formulas to MONA specifications. We present the tool PITL2MONA as an implementation of such translation. With PITL2MONA acting as a front-end, MONA is used as a decision procedure for PITL. To our knowledge, this is one of the few implementations of a decision procedure for PITL, the first one based on automata, and the only one which handles both projection and past operators. We have tested our implementation on a number of examples; we show in this paper the application of PITL and its MONA-based decision procedure in solutions to the dining-philosophers and a multimedia synchronisation problem, together with some experimental results on these and some other examples. (shrink)

Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement a...

We present a completeness proof for Propositional Interval Temporal Logic with finite time which avoids certain difficulties of conventional methods. It is more gradated than previous efforts since we progressively reduce reasoning within the original logic to simpler reasoning in sublogics. Furthermore, our approach benefits from being less constructive since it is able to invoke certain theorems about regular languages over finite words without the need to explicitly describe the associated intricate proofs. A modified version of (...) regular expressions called Fusion Expressions is used as part of an intermediate logic called Fusion Logic. Both have the same expressiveness as PITL but are lower-level notations which play an important role in the hierarchical structure of the overall completeness proof. In particular, showing completeness for PITL is reduced to showing completeness for Fusion Logic. This in turn is shown to hold relative to completeness for conventional linear-time temporal logic with finite time. Logics based on regular languages over finite words and!-words offer a promising but elusive framework for formal specification and verification. A number of such logics and decision procedures have been proposed. In addition, various researchers have obtained complete axiom systems by embedding and expressing the decision procedures directly within the logics. The work described here contributes to this topic by showing how to exploit some interesting links between regular languages and interval-based temporal logics. (shrink)

We introduce a two‐dimensional metric (interval) temporal logic whose internal and external time flows are dense linear orderings. We provide a suitable semantics and a sequent calculus with axioms for equality and extralogical axioms. Then we prove completeness and a semantic partial cut elimination theorem down to formulas of a certain type.

Linguistic phenomena of tense and aspect have been investigated in a great deal of theoretical work in linguistics, philosophy and computer science. Modern tense logics, established by Prior, are part of this effort. Point tense logics offer an intuitive representation of tense but lack the expressiveness to represent many aspectual structures. Interval tense logics offer more expressiveness but in the general case can be computationally intractable. From a linguistic perspective there is the problem of precisely how to formalise the (...) aspectual structures, such as a culmination and a culminated process. In this paper we define a computationally tractable augmented fragment of Halpern and Shoham's interval tense logic HS and apply it to represent a core set of aspectual structures, which are incorporated into a temporal semantics of a simple fragment of English. We model the logic fragment using timelines and define two procedures, one for constructing the minimal timelines that satisfy a formula and one for checking semantic entailments between one formula and another by comparing their timelines. The former is applied to compute models of temporal readings and the latter to check entailments between them. Possible extensions to the logic fragment and timeline models are discussed as ways of accounting for a wider range of linguistic behaviour. (shrink)

In this paper we look at the suitability of modern interval-based temporal logic for modeling John Buridan’s treatment of tensed sentences in his Sophismata. Building on the paper [Øhrstrøm 1984], we develop Buridan’s analysis of temporal logic, paying particular attention to his notions of negation and the absolute/relative nature of the future and the past. We introduce a number of standard modern propositional interval temporal logics to illustrate where Buridan’s interval-based temporal (...) analysis differs from the standard modern approaches. We give formal proofs of some claims in [Øhrstrøm 1984], and sketch how the standard modern systems could be defined in terms of Buridan’s proposals, showing that his logic can be taken as more basic. (shrink)

In this paper we look at the suitability of modern interval-based temporal logic for modeling John Buridan’s treatment of tensed sentences in his Sophismata. Building on the paper, we develop Buridan’s analysis of temporal logic, paying particular attention to his notions of negation and the absolute/relative nature of the future and the past.We introduce a number of standard modern propositional interval temporal logics to illustrate where Buridan’s interval-based temporal analysis differs from (...) the standard modern approaches. We give formal proofs of some claims in, and sketch how the standard modern systems could be defined in terms of Buridan’s proposals, showing that his logic can be taken as more basic. In diesem Aufsatz betrachten wir das Geeignetsein einer modernen intervallbasierten temporalen Logik für die Modellierung von John Buridans Behandlung zeitabhängiger Sätze in seinen Sophismata. Aufbauend auf den Aufsatz stellen wir Buridans Analyse der temporalen Logik dar, mit besonderer Berücksichtigung seiner Begriffe der Negation und der absoluten/relativen Natur der Zukunft und der Vergangenheit. Wir führen einige standardmäßige moderne intervallbasierte temporale Aussagenlogiken ein, um zu illustrieren, wo Buridans intervallbasierte temporale Analyse von den standardmäßigen modernen Zugangsweisen abweicht. Wir geben formale Beweise einiger Behauptungen in an und skizzieren, wie die standardmäßigen modernen Systeme im Sinne der Vorschläge Buridans definiert werden könnten; wir zeigen damit, dass seine Logik als die grundlegendere aufgefasst werden kann. (shrink)

In their simplest form, hybrid languages are propositional modal languages which can refer to states. They were introduced by Arthur Prior, the inventor of tense logic, and played an important role in his work: because they make reference to specific times possible, they remove the most serious obstacle to developing modal approaches to temporal representation and reasoning. However very little is known about the computational complexity of hybrid temporal logics.In this paper we analyze the complexity of the (...) satisfiability problem of a number of hybrid temporal logics: the basic hybrid language over transitive trees; nominal Until logic; and referential interval logic. We discuss the effects of including nominals, the @ operator, the somewhere modality E, and the difference operator D. Adding nominals to tense logic leads for several frame-classes to an increase in complexity of the satisfiability problem from PSPACE to EXPTIME. On transitive trees, however, the satisfiability problem for this language can be decided in PSPACE. Along the way we make a detour through hybrid propositional dynamic logic: we establish upper bounds for a number of temporal logics by generalizing results due to Passy and Tinchev [29] and De Giacomo [16]. We conclude with some remarks on the relevance of our results to description logic, and draw attention to the utility of the spypoint technique for proving upper and lower bounds. (shrink)

A logic of intervals is proposed akin to the one published by Hamblin (Hamblin (1969) and (1971)). Like Hamblin's, the present system is also based on a single primitive. However, the work presented here differs from Hamblin's in a number of respects. Most importantly, the present system is explicitly based on mereological ideas in such a way that not only are the two notions of abutment and temporal order involved in Hamblin's primitive two-place relation "abuts at the earlier (...) end" distinguished ; the temporal ordering itself is built up from a symmetric mereological primitive. The present system is shown to be complete. (shrink)

ABSTRACT Real-time graphical interval logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automted deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the (...) class='Hi'>logic and produces counterexamples to invalid proofs. The user interface includes a graphical editor that enables the user to create graphical formulas on a workstation display, and a database and proof manager that tracks proof dependencies and allows graphical formulas to be stored and retrieved. In this paper we describe the logic, the automated deduction system, and an application to robotics. (shrink)

We present a complete and cut-free proof-system for a fragment of MTL, where modal operators are only labelled by bounded intervals with rational endpoints.

We consider a new fragment of first-order logic with two variables. This logic is defined over interval structures. It constitutes unary predicates, a binary predicate and a function symbol. Considering such a fragment of first-order logic is motivated by defining a general framework for event-based interval temporal logics. In this paper, we present a sound, complete and terminating decision procedure for this logic. We show that the logic is decidable, and provide a (...) NEXPTIME complexity bound for satisfiability. This result shows that even a simple decidable fragment of first-order logic has NEXPTIME complexity. (shrink)

We present an introductory survey of temporal and dynamic logics: logics for reasoning about how environments change over time, and how dynamic processes affect their environments.We begin by introducing the historical development of temporal and dynamic logic, starting with the seminal work of Prior. This leads to a discussion of the use of temporal and dynamic logic in computer science. We describe LTL, CTL, and PDL; three key formalisms used in computer science for reasoning about (...) programs, and illustrate how these formalisms may be used in the formal specification and verification of computer systems.We then discuss interval temporal logics.We conclude with some pointers for further reading. (shrink)

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of (...) rest and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

In this paper we provide a mathematical model of Kant’s temporal continuum that yields formal correlates for Kant’s informal treatment of this concept in theCritique of Pure Reasonand in other works of his critical period. We show that the formal model satisfies Kant’s synthetic a priori principles for time and that it even illuminates what “faculties and functions” must be in place, as “conditions for the possibility of experience”, for time to satisfy such principles. We then present a mathematically (...) precise account of Kant’s transcendental theory of time—the most precise account to date.Moreover, we show that the Kantian continuum which we obtain has some affinities with the Brouwerian continuum but that it also has “infinitesimal intervals” consisting of nilpotent infinitesimals; these allow us to capture Kant’s theory of rest and motion in theMetaphysical Foundations of Natural Science.While our focus is on Kant’s theory of time the material in this paper is more generally relevant for the problem of developing a rigorous theory of the phenomenological continuum, in the tradition of Whitehead, Russell, and Weyl among others. (shrink)

In this paper, we investigate the relationship between two decidable interval-based temporal description logics that have been proposed in the literature, T L-ALCF and ALCF. Although many aspects of these two logics are quite similar, the two logics suggest two rather different paradigms for representing temporal conceptual knowledge. In this paper, we exhibit a reduction from T L-ALCF concepts to ALCF concepts that serves two purposes: first, it nicely illustrates the relationship between the two knowledge representation paradigms; (...) and second, it provides a tight PSPACE upper bound for T L-ALCF concept satisfiabiliy, whose complexity was previously unknown. (shrink)

Intervals and the events that occur in them are encoded as strings, elaborating on a conception of events as “intervals cum description.” Notions of satisfaction in interval temporal logics are formulated in terms of strings, and the possibility of computing these via finite-state machines/transducers is investigated. This opens up temporal semantics to finite-state methods, with entailments that are decidable insofar as these can be reduced to inclusions between regular languages.

Qualitative reasoning about space and time - a reasoning at the human level - promises to become a fundamental aspect of future systems that will accompany us in daily activity. The aim of Spatial and Temporal Reasoning is to give a picture of current research in this area focusing on both representational and computational issues. The picture emphasizes some major lines of development in this multifaceted, constantly growing area. The material in the book also shows some common ground and (...) a novel combination of spatial and temporal aspects of qualitative reasoning. Part I presents the overall scene. The chapter by Laure Vieu is on the state of the art in spatial representation and reasoning, and that by Alfonso Gerevini gives a similar survey on research in temporal reasoning. The specific contributions to these areas are then grouped in the two main parts. In Part II, Roberto Casati and Achille Varzi examine the ontological status of spatial entities; Anthony Cohn, Brandon Bennett, John Gooday, and Nicholas Gotts present a detailed theory of reasoning with qualitative relations about regions; Andrew Frank discusses the spatial needs of geographical information systems; and Annette Herskovits focuses on the linguistic expression of spatial relations. In Part III, James Allen and George Ferguson describe an interval temporal logic for the representation of actions and events; Drew McDermott presents an efficient way of predicting the outcome of plan execution; and Erik Sandewall introduces a semantics based on transitions for assessing theories of action and change. In Part IV, Antony Galton's chapter stands clearly between the two areas of space and time and outlines the main coordinates of an integrated approach. (shrink)

Foreword to the Special issue on Interval Temporal Logics and Duration Calculi.

We generalise an interval-related interpolation theorem about abstract-time Interval Temporal Logic, which was first obtained in [GUE 01]. The generalisation is based on the abstract-time variant of a projection operator in the Duration Calculus, which was introduced in [DAN 99] and later studied extensively in [GUE 02]. We propose a way to understand interpolation in the context of formal verification. We give an example showing that, unlike abstract-time ITL, DC does not have the Craig interpolation property (...) in general, and establish a special form of Craig interpolation for abstract-time DC. Explicit definability after Beth is known to be strongly related to Craig interpolation in general. We show a limitation of a different kind to the scope of Beth definability in ITL by a counterexample too. We call the generalisation of interval-related interpolation that we present projection-related interpolation. The DC-specific restrictions apply to it too. We show that both Craig and projection-related interpolation hold about the ⌈P⌉-subset of DC without such restrictions. Our proofs of these theorems for the ⌈P⌉-subset entail algorithms for the construction of the interpolants. (shrink)

ABSTRACT A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ?next week's weekend?. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ?yesterday I worked for eight hours with one hour lunch break at noon?. Calendar Logic can be translated into propositional logic. (...) Satisfiability is therefore decidable. Since the translation is exponential, a tableau decision procedure for checking decidability is presented as an alternative. (shrink)

A “conceptual spaces” approach is used to formalize Aristotle’s main intuitions about time and change, and other ideas about temporal points of view. That approach has been used in earlier studies about points of view. Properties of entities are represented by locations in multidimensional conceptual spaces; and concepts of entities are identified with subsets or regions of conceptual spaces. The dimensions of the spaces, called “determinables”, are qualities in a very general sense. A temporal element is introduced by (...) adding a time variable to state functions that map entities into conceptual spaces. That way, states may have some permanency or stability around time instances. Following Aristotle’s intuitions, changes and events will not be necessarily instant phenomena, instead they could be processual and interval dependent. Change is defined relatively to the interval during which the change is taking place. Time intervals themselves are taken to represent points of view. To have a point of view is to look at the world as it is in the selected interval. Many important concepts are relativized to intervals, for instance change, events, identity, ontology, potentiality, etc. The definition of points of view as intervals allows to compare points of view in relation to all these concepts. The conceptual space approach has an immediate semantic and structural character, but it is tempting to develop also logics to describe them. A formal language is introduced to show how this could be done. (shrink)

G. H. von Wright proposed that a temporal interval exemplifies a real contradiction if at least one part of any division of this interval involves the presence of contradictorily related (though non-simultaneous) states. In connection with intervals, two negations must be discerned: 'does not hold at an interval' and 'fails throughout an interval'. Von Wright did not distinguish the two. As a consequence, he made a mistake in indicating how to use his logical symbolism to (...) express the notion of real contradiction. The present paper aims to reconstruct and philosophically motivate von Wright's argument for the possibility of real contradictions. (shrink)

The present study on al-Dīn Suhrawardī's Ḥikmat al-Ishrāq, develops some preliminary explorations on his logic under the background of his remarkable epistemology of pis some witness of d resence. The paper paves the way for responding to the challenges of Tony Street on the compatibility of Suhrawardī's critique of Ibn Sīnā with the development of a temporal and modal syllogism that at first sight seems quite close to that of Ibn Sīnā. In fact, Suhrawardī's modalities are to be (...) understood as the different ways a predicate relates to its subject rather than as propositional operators. Accordingly, necessarily necessary modality relates actual instances (presences) of the Subject-Term with actual (presences) of the Predicate-Term; in contrast, necessarily contingent modality relates these terms conditionally, notably involving states of the Subject-Term within time intervals. Suhrawardī's main innovation, so we claim, is the explicit dialectical role presences or actual instances have in his modal-temporal logic, and particularly so in shaping his notion of contingency that admits both a generic and an individual or de re form of plenitude. (shrink)

Art creates a specific relation to time and especially to the present moment. It opens the experience of the present towards its indeterminacy and emergence. On the contrary, AI does not know the present. It recognizes only the past and future. We could even say that artificial neural networks do not “know” time at all. Instead, they know only logical functions which process patterns of information. Yet, what makes time “time” is genuine transformation, which happens outside of the abstract realm (...) of logic. I support these observations by analysing two works of art: Bill Viola’s The Raft (2004) and Hito Steyerl’s This Is the Future (2019). While artistic creation opens up the intervals “in-between seconds” for an unpredictable and transformative event to occur (The Raft), AI closes these intervals and fastens the future into predictability calculated on the basis of past data (This Is the Future). Although this machinic operation makes the present even more unpredictable and prone to catastrophes, its potential for transformation seems to be withdrawn. (shrink)

Temporal Logic: From Ancient Ideas to Artificial Intelligence deals with the history of temporal logic as well as the crucial systematic questions within the field. The book studies the rich contributions from ancient and medieval philosophy up to the downfall of temporal logic in the Renaissance. The modern rediscovery of the subject, which is especially due to the work of A. N. Prior, is described, leading into a thorough discussion of the use of (...) class='Hi'>temporal logic in computer science and the understanding of natural language. Temporal Logic: From Ancient Ideas to Artificial Intelligence thus interweaves linguistic, philosophical and computational aspects into an informative and inspiring whole. (shrink)

This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying (...) methodologies, this book is an indispensable reference for both the pure logician and the theoretical computer scientist. (shrink)

Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify this, I have developed a first‐order temporal logic, in which it is possible to name and prove things about facts, events, plans, and world histories. In particular, the logic provides analyses of causality, continuous change in quantities, the persistence of facts (the frame problem), and the relationship between tasks (...) and actions. It may be possible to implement a temporal‐inference machine based on this logic, which keeps track of several “maps” of a time line, one per possible history. (shrink)

ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a (...) way more expressive medium for reasoning about branching time. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a (...) way more expressive medium for reasoning about branching time. (shrink)

When is a proposition true? It is common to expert an answer of the form “at instant x”. In section I) I present an example of the consequences that such instantaneous semantics in tense logic can have, and review some of the problems that have led to the proposal of using intervals, rather than instants, as the indices at which to evaluate propositions. In the section II) I present some of the problems with the intervals themselves, and in section (...) III) I consider the possibilities of having he best of both worlds. Due to the still tentative character of interval semantics, I focus on the consideration of metatheoretical issues rather than on the technical points of the particular systems of interval semantics so far proposed. (shrink)

In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.

This work concerns the use of operators for past and future contingency in Priorean temporal logic. We will develop a system named C_t, whose language includes a propositional constant and prove that (I) C_t is complete with respect to a certain class of general frames and (II) the usual operators for past and future necessity are definable in such system. Furthermore, we will introduce the extension C_t(lin) that can be interpreted on linear and transitive general frames. The theoretical (...) result of the current work is that contingency can be treated as a primitive notion in reasoning about temporal modalities. (shrink)

I present a variant of with time, called, interpreted in standard Kripke semantics. On the syntactic level, is nothing but the extension of atemporal individual by: the future tense and past tense operators, and the operator of group agency for the grand coalition. A sound and complete axiomatisation for is given. Moreover, it is shown that supports reasoning about interesting normative concepts such as the concepts of achievement obligation and commitment.

In this paper, we study temporal logic for finite linear structures and surjective bounded morphisms between them. We give a characterisation of such structures by modal formulas and show that every pair of linear structures with a bounded morphism between them can be uniquely characterised by a temporal formula up to an isomorphism. As the main result, we prove Kripke completeness of the logic with respect to the class of finite linear structures with bounded morphisms between (...) them. (shrink)

This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three submethods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional (...) temporal languages with varying expressivity and varying degrees of transfer of logical properties. The temporalization method and the independent combination method are shown to transfer all three basic logical properties. The method of full join of logic systems generates a considerably more expressive language but fails to transfer completeness and decidability in several cases. So a weaker method of restricted join is proposed and shown to transfer all three basic logical properties. (shrink)