In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance (...) Stit Logics. (shrink)

Temporal logic is one of the many areas in which a possible world semantics is adopted. Prior's Ockhamist and Peircean semantics for branching-time, though, depart from the genuine Kripke semantics in that they involve a quantification over histories, which is a second-order quantification over sets of possible worlds. In the paper, variants of the original Prior's semantics will be considered and it will be shown that all of them can be viewed as first-order counterparts of the original semantics.

The basic notions in Prior’s Ockhamist and Peircean logics of branching-time are the notion of moment and that of history (or course of events). In the tree semantics, histories are defined as maximal linearly ordered sets of moments. In the geometrical approach, both moments and histories are primitive entities and there is no set theoretical (and ontological) dependency of the latter on the former. In the topological approach, moments can be defined as the elements of a rank 1 base of (...) a non-Archimedean topology on the set of histories. In this paper, it will be shown that the topological approach, and hence the other approaches, can be reconstructed in a framework in which the basic notions are those of history and of relative closeness relation among histories. (shrink)

The basic notions in Prior's Ockhamist and Peircean logics of branching-time are the notion of moment and that of history. In the tree semantics, histories are defined as maximal linearly ordered sets of moments. In the geometrical approach, both moments and histories are primitive entities and there is no set theoretical dependency of the latter on the former. In the topological approach, moments can be defined as the elements of a rank 1 base of a non-Archimedean topology on the set (...) of histories. In this paper, it will be shown that the topological approach, and hence the other approaches, can be reconstructed in a framework in which the basic notions are those of history and of relative closeness relation among histories. (shrink)

In Ockhamist branching-time logic [Prior 67], formulas are meant to be evaluated on a specified branch, or history, passing through the moment at hand. The linguistic counterpart of the manifoldness of future is a possibility operator which is read as `at some branch, or history (passing through the moment at hand)'. Both the bundled-trees semantics [Burgess 79] and the $\langle moment, history\rangle$ semantics [Thomason 84] for the possibility operator involve a quantification over sets of moments. The Ockhamist frames are (3-modal) (...) Kripke structures in which this second-order quantification is represented by a first-order quantification. The aim of the present paper is to investigate the notions of modal definability, validity, and axiomatizability concerning 3-modal frames which can be viewed as generalizations of Ockhamist frames. (shrink)

In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate logic (...) are desirable, and in this paper I present two such results. The main developments in this area can be split into two directions, differing in the question whether the ordering of time is world-independent or not. Semantically, this difference appears in the discussion whether T x W-frames or Kamp-frames (resp. Ockham-frames) provide a suitable semantics for combinations of tense and modality. Here, two calculi are presented, the first adequate with respect to Kamp-semantics, the second to T x Wsemantics. (Both calculi contain an appropriate version of Gabbay's irreflexivity rule.) Furthermore, the proposed constructions of canonical frames simplify some of those which have hitherto been discussed. (shrink)

We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ rules, then Λ+ is (...) strongly sound and complete with respect to the class of frames determined by the axioms and the rules. (shrink)

Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...) a version of the bundle semantics. (shrink)

The transition semantics presented in Rumberg (J Log Lang Inf 25(1):77–108, 2016a) constitutes a fine-grained framework for modeling the interrelation of modality and time in branching time structures. In that framework, sentences of the transition language L_t are evaluated on transition structures at pairs consisting of a moment and a set of transitions. In this paper, we provide a class of first-order definable Kripke structures that preserves L_t-validity w.r.t. transition structures. As a consequence, for a certain fragment of L_t, validity (...) w.r.t. transition structures turns out to be axiomatizable. The result is then extended to the entire language L_t by means of a quite natural ‘Henkin move’, i.e. by relaxing the notion of validity to bundled structures. (shrink)

We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.

The paper deals with the problem of axiomatizing a system T1 of discrete tense logic, where one thinks of time as the set Z of all the integers together with the operations +1 ("immediate successor") and-1 ("immediate predecessor"). T1 is like the Segerberg-Sundholm system WI in working with so-called infinitary inference ruldes; on the other hand, it differs from W I with respect to (i) proof-theoretical setting, (ii) presence of past tense operators and a "now" operator, and, most importantly, with (...) respect to (iii) the presence in T1 of so-called systematic frame constants, which are meant to hold at exactly one point in a temporal structure and to enable us to express the irreflexivity of such structures. Those frame constants will be seen to play a paramount role in our axiomatization of T1. (shrink)

In an earlier paper by the author, Åqvist , I presented an approach to the logic of historical necessity, or inevitability, in the sense of a “two-dimensional” combination of tense and modal logic for worlds, or histories, with the same time order, known as T × W logic. Distinctive features of that approach were, apart from its two-dimensionality, its being based on discrete and finite time, and its use of so-called systematic frame constants in order to enable us to indicate (...) longitudes and latitudes of any points in the co-ordinate systems under consideration. This led us to study and axiomatize an infinite hierarchy HTWxy of two-dimensional modal tense logics with the characteristic operators for historical necessity and possibility added to the original basic vocabulary. The main purpose of the present paper is then twofold: to extend the logics HTWxy to the interesting branch of philosophical logic constituted by deontic logic as combined with tense logic; and to deal with a curious puzzle known as the so-called epistemic obligation paradox – a well known stumbling-block in this area of research in philosophical logic. We argue for a solution to both these problems, which appeals to a new infinite hierarchy DHTWxym of extensions of the HTWxy in the sense of logics combining dyadic deontic modalities with temporal ones such as those for historical necessity and other two-dimensional modalities. (shrink)

This paper investigates the semantic treatment of conditional obligation, explicit permission (often called positive permission), and prohibition based on models with agents and branched time. In such models branches (rather than moments) are taken as basic, and the branching provides a way to represent the indeterminism which is normally presupposed by talk of free will, responsibility, action and ability. Careful treatment of the relation between ability and responsibility avoids many common problems with accounts of conditional obligation. Recognition of the generality (...) often involved in conditional obligations makes possible a sensitive way of expressing some kinds of general prohibitions, which in turn makes it possible to account for the special role of explicit permission. (shrink)

In this paper we shall introduce a simple temporal logic suitable for reasoning about the temporal aspects of parallel universes, parallel processes, distributed systems, or multiple agents. We will use a variant of the mosaic method to prove decidability of this logic. We also show that the logic does not have the finite model property. This shows that the mosaic method is sometimes a stronger way of establishing decidability.

The semantical structures called T x W frames were introduced in (Thomason, 1984) for the Ockhamist temporal-modal language, $[Unrepresented Character]_{o}$ , which consists of the usual propositional language augmented with the Priorean operators P and F and with a possibility operator ◇. However, these structures are also suitable for interpreting an extended language, $[Unrepresented Character]_{so}$ , containing a further possibility operator $\lozenge^{s}$ which expresses synchronism among possibly incompatible histories and which can thus be thought of as a cross-history 'simultaneity' operator. (...) In the present paper we provide an infinite set of axioms in $[Unrepresented Character]_{so}$ , which is shown to be strongly complete for T x W-validity. Von Kutschera (1997) contains a finite axiomatization of T x W-validity which however makes use of the Gabbay Irreflexivity Rule (Gabbay, 1981). In order to avoid using this rule, the proof presented here develops a new technique to deal with reflexive maximal consistent sets in Henkin-style constructions. (shrink)

T × W logic is a combination of tense and modal logic for worlds or histories with the same time order. It is the basis for logics of causation, agency and conditionals, and therefore an important tool for philosophical logic. Semantically it has been defined, among others, by R. H. Thomason. Using an operator expressing truth in all worlds, first discussed by C. M. Di Maio and A. Zanardo, an axiomatization is given and its completeness proved via D. Gabbay’s irreflexivity (...) lemma. Given this lemma the proof is more or less straight forward. At the end an alternative axiomatization is sketched in which Di Maio’s and Zanardo’s operator is replaced by a version of “actually”. (shrink)

This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system.

Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly complete.

The semantical structures called T×W frames were introduced in (Thomason, 1984) for the Ockhamist temporal-modal language, ℒO, which consists of the usual propositional language augmented with the Priorean operators P and F and with a possibility operator ⋄. However, these structures are also suitable for interpreting an extended language, ℒSO, containing a further possibility operator ⋄s which expresses synchronism among possibly incompatible histories and which can thus be thought of as a cross-history ‘simultaneity’ operator. In the present paper we provide (...) an infinite set of axioms in ℒSO, which is shown to be strongly complete forT ×W-validity. Von Kutschera (1997) contains a finite axiomatization of T×W-validity which however makes use of the Gabbay Irreflexivity Rule (Gabbay, 1981). In order to avoid using this rule, the proof presented here develops a new technique to deal with reflexive maximal consistent sets in Henkin-style constructions. (shrink)

Prior investigated a tense logic with an operator for ‘historical necessity’, where a proposition is necessary at a time iff it is true at that time in all worlds ‘accessible’ from that time. Axiomatisations of this logic all seem to require non-standard axioms or rules. The present paper presents an axiomatisation of a first-order version of Prior’s logic by using a predicate which enables any time to be picked out by an individual in the domain of interpretation.

We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof of completeness (...) for the corresponding Hilbert-style axiomatization, but also in the development of a mosaic-based tableau system. We further consider extensions for dealing with the case when interactions between the two dimensions exist, thus covering a wide class of bundled Ockhamist branching-time logics, and present for them some partial results, such as a non-analytic version of the tableau system. (shrink)

Combining modalities has proven to have interesting applications and many approaches that combine time with other types of modalities have been developed. One of these approaches uses accessibility functions between flows of time to study the basic properties of the functions, such as being total or partial, injective, surjective, etc. The completeness of certain systems expressing many of these properties, with the exception of surjectivity, has been proven. In this paper we propose a language with nominals to denote the initial (...) and final sets of each function in a model in order to obtain a complete system for reasoning about surjective partial functions. (shrink)

For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated restricted variables called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modality, localized to the set of all possible futures at the actual moment of time.We construct an axiomatic system for this (...) extended branching-time logic and prove its soundness and completeness with respect to bundle tree semantics. Finally, we show how our axiomatic system can be extended with a variety of important additional operators, such as Since and Until, a global difference operator, operators for undivided and divided histories, reference pointers, etc. (shrink)