Abstract
The concept of a “branching structure” includes the notion of a “tree”, of which it is a generalization. That is, dropping the conditions of discreteness and rootedness from the concept of a tree, we define a branching structure to be a set 7 over which a binary relation U (the accessibility relation of temporal posteriority) is defined, satisfying the conditions
and
Some examples of branching structures are Here the points (indicated in the finite case by nodal circles) are 7-elements and the connecting lines (indicated in the finite case by arrows and in the infinite case by relative placement from left to right) represent the U-relation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1971 Springer-Verlag/Wien
About this chapter
Cite this chapter
Rescher, N., Urquhart, A. (1971). Branching Time: The System K b . In: Temporal Logic. LEP Library of Exact Philosophy, vol 3. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7664-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7664-1_7
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-7666-5
Online ISBN: 978-3-7091-7664-1
eBook Packages: Springer Book Archive