Abstract
Time-travel is a popular topic not only in science fiction, but in physics as well, especially when it concerns the notion of “changing the past”. It turns out that if time-travel exists, it will follow certain logical rules. In this paper we apply the tools of discrete mathematics to two such sets of rules from theoretical physics: the Novikov Self Consistency Principle and the Many Worlds Interpretation of quantum mechanics. Using temporal logic, we can encode the dynamics of a time-travel story or game, and model-check them for adherence to the rules. We also present the first ever game-engine following these rules, allowing the development of technically accurate time-travel games.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The authors are fairly confident in drawing these parallels, but it has to be noted that neither has a background in theoretical physics.
- 2.
injective: each state has at most one predecessor, i.e., timelines do not merge.
- 3.
(partial) function: each state has at most one successor, i.e., timelines do not branch.
- 4.
- 5.
References
Chellas, B.F.: Modal Logic: An Introduction, vol. 316. Cambridge University Press, Cambridge (1980)
Friedman, J., Morris, M.S., Novikov, I.D., Echeverria, F., Klinkhammer, G., Thorne, K.S., Yurtsever, U.: Cauchy problem in spacetimes with closed timelike curves. Phys. Rev. D 42(6), 1915–1930 (1990)
Fujibayashi, H.: The Legend of Zelda: Oracle of Ages (2001). http://www.zelda.com/oracle
Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 163–173. ACM (1980)
Heinlein, R.A.: By His Bootstraps, October 1941
Laroussinie, F., Schnoebelen, P.: Specification in CTL+ past for verification in CTL. Inf. Comput. 1(156), 236–263 (2000)
Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 196–218. Springer, Heidelberg (1982)
Markey, N.: Temporal logic with past is exponentially more succinct. EATCS Bull. 79, 122–128 (2003)
Nahin, P.: Time Travel: A Writer’s Guide to the Real Science of Plausible Time Travel. Johns Hopkins University Press, Baltimore (2011)
Nahin, P.: Time Machines: Time Travel in Physics, Metaphysics, and Science Fiction, 2nd edn. Springer, New York (2014). Softcover reprint of the original, 2nd edn. 1999th edn
Schrödinger, E.: Die gegenwärtige situation in der quantenmechanik. Naturwissenschaften 23(49), 823–828 (1935)
Stephenson, M.: NetHack (1987). http://www.nethack.org
Zemeckis, R.: Back to the Future, iMDB ID: tt0088763, July 1985
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Helvensteijn, M., Arbab, F. (2016). Toward a Formal Foundation for Time Travel in Stories and Games. In: Ábrahám, E., Bonsangue, M., Johnsen, E. (eds) Theory and Practice of Formal Methods. Lecture Notes in Computer Science(), vol 9660. Springer, Cham. https://doi.org/10.1007/978-3-319-30734-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-30734-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30733-6
Online ISBN: 978-3-319-30734-3
eBook Packages: Computer ScienceComputer Science (R0)