Nordic Journal of Philosophical Logic 5 (1):3-24 (2000)
|Abstract||There are numerous occasions on which we need to reason about a finite number of events. And we often need to consider only those events which are given or which we perceive. These give rise to the Criteria of Finiteness and Closedness. Allen's logic provides a way of reasoning about events. In this paper I examine Allen and Hayes' axiomatisation of this logic, and develop two other axiomatisations based on the work by Russell and Thomason. I shall show that these three axiomatisations are weakly equivalent, and that only the last two meet the Criteria of Finiteness and Closedness (to different degrees). I shall then examine two ways of constructing instants of time in a finite and closed world, i.e. the Russell construction and the Thomason construction. I shall prove that these two constructions are equivalent under certain conditions|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Balazs Gyenis & Miklos Redei (2004). When Can Statistical Theories Be Causally Closed? Foundations of Physics 34:1285-1303.
Michal Marczyk & Leszek Wronski, Exhaustive Classication of Finite Classical Probability Spaces with Regard to the Notion of Causal Up-to-N-Closedness.
Wai Yan Pong (2000). Some Applications of Ordinal Dimensions to the Theory of Differentially Closed Fields. Journal of Symbolic Logic 65 (1):347-356.
Tim Fernando (2011). Constructing Situations and Time. Journal of Philosophical Logic 40 (3):371 - 396.
Maricarmen Martinez (2001). Some Closure Properties of Finite Definitions. Studia Logica 68 (1):43-68.
Rowland Stout, Penultimate Draft of “Two Ways to Understand Causality in Agency”, for Anton Leist (Ed.), Action in Context.
S. K. Thomason (1989). Free Construction of Time From Events. Journal of Philosophical Logic 18 (1):43 - 67.
René David & Karim Nour (1995). Storage Operators and Directed Lambda-Calculus. Journal of Symbolic Logic 60 (4):1054-1086.
J. Ismael (2003). Closed Causal Loops and the Bilking Argument. Synthese 136 (3):305 - 320.
Eric Rosen (1997). Modal Logic Over Finite Structures. Journal of Logic, Language and Information 6 (4):427-439.
Gunther Mainhardt (2004). P Versus Np and Computability Theoretic Constructions in Complexity Theory Over Algebraic Structures. Journal of Symbolic Logic 69 (1):39-64.
Jörg Flum, Matthias Schiehlen & Jouko Väänänen (1999). Quantifiers and Congruence Closure. Studia Logica 62 (3):315-340.
Added to index2010-08-24
Total downloads4 ( #188,662 of 722,698 )
Recent downloads (6 months)1 ( #60,006 of 722,698 )
How can I increase my downloads?