Nordic Journal of Philosophical Logic 5 (1):3-24 (2000)
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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
When Can Statistical Theories Be Causally Closed?Balazs Gyenis & Miklos Redei - 2004 - Foundations of Physics 34 (9):1285-1303.
Exhaustive Classication of Finite Classical Probability Spaces with Regard to the Notion of Causal Up-to-N-Closedness.Michal Marczyk & Leszek Wronski - unknown
Some Applications of Ordinal Dimensions to the Theory of Differentially Closed Fields.Wai Yan Pong - 2000 - Journal of Symbolic Logic 65 (1):347-356.
Constructing Situations and Time.Tim Fernando - 2011 - Journal of Philosophical Logic 40 (3):371 - 396.
Some Closure Properties of Finite Definitions.Maricarmen Martinez - 2001 - Studia Logica 68 (1):43-68.
Two Ways to Understand Causality in Agency.Rowland Stout - 2007 - In A. Leist (ed.), Action in Context.
Free Construction of Time From Events.S. K. Thomason - 1989 - Journal of Philosophical Logic 18 (1):43 - 67.
Storage Operators and Directed Lambda-Calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
Modal Logic Over Finite Structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
P Versus Np and Computability Theoretic Constructions in Complexity Theory Over Algebraic Structures.Gunther Mainhardt - 2004 - Journal of Symbolic Logic 69 (1):39-64.
Quantifiers and Congruence Closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.
Added to index2010-08-24
Total downloads15 ( #312,718 of 2,164,296 )
Recent downloads (6 months)1 ( #348,039 of 2,164,296 )
How can I increase my downloads?