Hostname: page-component-76d6cb85b7-hqrjx Total loading time: 0 Render date: 2026-07-10T23:45:55.116Z Has data issue: false hasContentIssue false

THE TEMPORAL CONTINUUM

Published online by Cambridge University Press:  12 April 2024

MOHAMMAD ARDESHIR
Affiliation:
DEPARTMENT OF MATHEMATICS SHARIF UNIVERSITY OF TECHNOLOGY 11365-9415 TEHRAN, IRAN E-mail: mardeshir@sharif.edu
RASOUL RAMEZANIAN*
Affiliation:
DEPARTMENT OF ECONOMICS, UNIVERSITY OF LAUSANNE INTERNEF 1015 LAUSANNE, SWITZERLAND

Abstract

The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a line is composed of points, while others, like Aristotle, Weyl, and Brouwer, argued that a line is not composed of points but rather a matrix of a continued insertion of points. In spite of this disagreement on the structure of the continuum, they did distinguish the temporal line from the spatial line. In this paper, we argue that there is indeed a difference between the intuition of the spatial continuum and the intuition of the temporal continuum. The main primary aspect of the temporal continuum, in contrast with the spatial continuum, is the notion of orientation.

The continuum has usually been mathematically modeled by Cauchy sequences and the Dedekind cuts. While in the first model, each point can be approximated by rational numbers, in the second one, that is not possible constructively. We argue that points on the temporal continuum cannot be approximated by rationals as a temporal point is a flow that sinks to the past. In our model, the continuum is a collection of constructive Dedekind cuts, and we define two topologies for temporal continuum: 1. oriented topology and 2. the ordinary topology. We prove that every total function from the oriented topological space to the ordinary one is continuous.

Information

Type
Research Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable