Main page and contacts
Main page for Time and Aspect

Martin H. Prior * Formalisation of Aspect: Further Work
36th Linguistic Colloquium, University of Ljubljana, 12th-14th September, 2001


Towards a 'Differential Predicate Calculus'?

This page provides the Abstract for the above paper and an adaptation of the associated handout for the web. It further links (here and elsewhere) to a general bibliography on Time and Aspect.

The paper will eventually be published in Proceedings of the 36th Linguistic Colloquium, held at the Faculty of Philosophy, University of Ljubljana, Slovenia, 12th-14th September, 2001.

Colloquium Site


self on right


ABSTRACT

In a paper given two years ago to the 34th Linguistic Colloquium at Mainz on the The Formal Representation of Aspect, I outlined a model adapting Davidson's Theory of Action to Priorean Tense Logic.

My adaptation of the Davidsonian model separated out actions and processes where the process separated out a change or continuation in the state of an object. Thus we might have

P dt($ Q) (Arriving(Q) Ù Object (Q, x))

'x arrived at time dt'

Now I used dt and dt to capture points of time and intervals of time respectively, and I would like to extend the use of d/d to actions and processes themselves. Thus the above formula for 'x arrived' might become

P dt($ f) (Arriving(f) Ù df(x))

Here we capture change over time, relating  df  and dt, a little like df/dt. In this paper I would like to look more closely at the properties of d and d with respect to both time references and actions and processes.

It is this model I shall presume to call 'Differential Predicate Calculus'.



HANDOUT

0.

The following formula re-caps the representation of the simple past from previous work.

P du ($ Q) (H d u* ($ A) (P* Agent(x, A) Ù Kicking(A,Q)) Ù [Telic Operator] Compl Object (Q, y)
Ù Through (Q, z)))

x kicked the ball (y) through the goal-posts (z)
(qv. Tense operators)

 

1a. du = ~u Ù F +0 u               1b. cu = u Ù P -0 ~u

 

Numeric uses

y = f(x)

y + d y = f(x +d x)
d y = f(x +d x) - y

y - g y = f(x -g x)
g y = y - f(x -g x)

Uses conjectured for logical form

2a. d u  É  du0 Ú du1
2b. d u  É  du0 Ú d u1
2c. d u  É  du0 Ú du1

3a. g u  É  cu1 Ú cu0
3b. g u  É  g u1 Ú cu0
3c. g u  É  g u1 Ú g u0

 

 

 

4.


 

d, d

 

g , c

(1)

dp É  d p

 

cp É g  p

(2)

d p É  ~ p

 

cp É  p

(3)

g  p É  cp  Ú  d p   (or just   p Ú d p ?)

(4)

(d p Ù  d q)  É  d (p Ù q)

but not necessarily

(d p Ù d q)  É    d (p Ù q)

 

(c p Ù  c q)  É  c (p Ù q)

but not necessarily

(g  p Ùg  q)  É  g  (p Ù q)

(5)

d (p Ù q)     É  (d p Ú d q)

 

g   (p Ù q)     É  (g  p Ú g  q)

(6)

d (p Ú q)     É  (d p Ú d q)

 

g   (p Ú q)     É  (g  p Ú g  q)

(7)

(d p Ù d q)  É    d (p Ú q)

 

(g  p Ùg  q)  É  g  (p Ú q)

(8)

 p  É d  q    É   d  (p É q)

 

 p  É g  q    É g (p Ù q) Ú g ~ p

(9)

d  (p É q)   É    d  (p Ù q) Ú d ~ p

 

g  (p É q)   É    g  (p Ù q) Ú g ~ p

 

 

 

 

 

and what about

 

 

(10)

d (p Ù q)     É  (d p Ú  (p Ù~d ~p))

 

g  (p Ú q)     É  (g  p Ú  (p Ù~g ~p))

 

 

 

 

(Picture: .jpg .png)



Comparison of delta and gamma
Thumb-nail of above...
Click thumb-nail for draft entailments for gamma...
This version 13:51 07/04/05