Tree formulations of tense logic

Abstract

The tense tree method extends Jeffrey’s well-known formulation of classical propositional logic to tense logic (Jeffrey 1991).1 Tense trees combine pure tense logic with features of Prior’s U-calculi (where ‘U’ is the earlier-than relation; see Prior 1967 and the Introduction to this volume). The tree method has a number of virtues: trees are well suited to computational applications; semantically, the tree systems presented here are no less illuminating than model theory; the metatheory associated with tree formulations is often more tractable than that required in a model-theoretic setting; and last but not least the tree method is ideal for pedagogical purposes.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete.Lucas Champollion - 2011 - Journal of Logic, Language and Information 20 (3):343-359.
Tense trees: a tree system for ${\rm K}_{{\rm t}}$.B. J. Copeland - 1983 - Notre Dame Journal of Formal Logic 24 (3):318-322.
‘Now’ and ‘Then’ in Tense Logic.Ulrich Meyer - 2009 - Journal of Philosophical Logic 38 (2):229-247.
Tree models and (labeled) categorial grammar.Yde Venema - 1996 - Journal of Logic, Language and Information 5 (3-4):253-277.
Building iteration trees.Alessandro Andretta - 1991 - Journal of Symbolic Logic 56 (4):1369-1384.

Analytics

Added to PP
2009-01-28

Downloads
1 (#1,769,934)

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references