Axioms for Branching Time

@article{Reynolds2002AxiomsFB,
  title={Axioms for Branching Time},
  author={Mark Reynolds},
  journal={J. Log. Comput.},
  year={2002},
  volume={12},
  pages={679-697}
}
Logics of general branching time, or historical necessity, have long been studied but important axiomatization questions remain open. Here the difficulties of finding axioms for such logics are considered and ideas for solving some of the main open problems are presented. A new, more expressive logical account is also given to support Peirce's prohibition on truth values being attached to the contingent future. 

Figures from this paper

Wally axiomatics of Branching Continuations

We give a brief introduction to the axiomatization of temporal logics. Branching continuations are shortly presented thereafter and the possibility of their clear syntactical axiomatization in a

Axiomatization of a Branching Time Logic with Indistinguishability Relations

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

Quantification over Sets of Possible Worlds in Branching-Time Semantics

  • A. Zanardo
  • Philosophy, Computer Science
    Stud Logica
  • 2006
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 theOriginal Prior semantics.

w ally a xiOma TiCS OF BraNCHiNG CONTiNua TiONS

e motivation behind axiomatization of Branching continuations is presentrst. �en semantics of Branching continuations are briey explained. �ereaer we give a short introduction to the axiomatization

Logic and Philosophy of Time: Further Themes from Prior

ABE In this paper, we show that a particular thin red line semantics introduced by Bräuner, Øhrstrøm, andHaslemakes the so-called Burgess’ formula 2G(φ →3Fφ)→3G(φ → Fφ) invalid, and we discuss some

Bivalence and Future Contingency

This work presents an overview of four different approaches to the problem of future contingency and determinism in temporal logics, and introduces Ockhamism, Peirceanism, Actualism and T x W semantics, the four most relevant bivalent alternatives in this area.

Rewrite rules for CTL

Verification of Rewrite Rules for Computation Tree Logics

It is shown that non-local computation tree logics can be used to verify rewrite rules, including for CTL*, and shown that NL-BCTL* is 2EXPTIME-complete, which is strictly more expressive than LTL or CTL.

The Machine Scenario: A Computational Perspective on Alternative Representations of Indeterminism

This work adds a new stance to the debate: moment-based structures can be said to rule out certain indeterministic scenarios that are computationally unfeasible.

The Machine Scenario: A Computational Perspective on Alternative Representations of Indeterminism

This work adds a new stance to the debate: moment-based structures can be said to rule out certain indeterministic scenarios that are computationally unfeasible.

References

SHOWING 1-10 OF 36 REFERENCES

The decision problem for branching time logic

Here it is proved the decidability of the first-order theory of binary, bounded, well-founded trees with additional unary predicates is proved.

An axiomatization of full Computation Tree Logic

A sound and complete axiomatization for the full computation tree logic of R-generable models is given and solves a long standing open problem in branching time temporal logic.

A Hierarchy of Temporal Logics with Past

Results on the Propositional µ-Calculus

A propositional version of the Μ-calculus is defined, and an exponential-time decision procedure, small model property, and complete deductive system is given, and it is shown that it is strictly more expressive than PDL.

Axiomatization of ‘Peircean’ branching-time logic

The branching-time logic called ‘Peircean’ by Arthur Prior is considered and given an infinite axiomatization. The axiomatization uses only the standard deduction rules for tense logic.

A complete deductive-system for since-until branching-time logic

  • A. Zanardo
  • Mathematics, Computer Science
    J. Philos. Log.
  • 1991
La notion forte de validite ockhamiste est appliquee a une logique propositionnelle contenant un operateur modal et deux operateurs temporels : « depuis » et « jusqu'a ». L'A. en donne

Decidability for branching time

The species of indeterminist tense logic called ‘Peircean’ by A. N. Prior is proved to be recursively decidable.

Results on the Propositional mu-Calculus

  • D. Kozen
  • Mathematics
    Theor. Comput. Sci.
  • 1983

Modal and temporal logics

♦ Büchi automata represent an operational approach to describing temporal requirements for reactive systems ♦ Usage of logics for the descriptive specification of temporal requirements 8 example –

Decidability of Deliberative Stit Theories with Multiple Agents

The purpose of this paper is to present axiomatizations for some dstit (deliberatively seeing-to-it-that) logics with multiple agents, and prove the completeness and decidability by way of finite