A Completeness Result for Quantificational Tense Logic

✍ Scribed by Robert P. McArthur; Hugues Leblanc

• Publisher: John Wiley and Sons
• Year: 1976
• Tongue: English
• Weight: 529 KB
• Volume: 22
• Category: Article
• ISSN: 0044-3050
• DOI: 10.1002/malq.19760220110

✦ Synopsis

We establish in this paper the strong completeness of QK,, a minimal quantificational tense logic. Our result differs from those already in the literature, say [l], in two major respects. First, unlike COCCHIARELLA'S proof, which utilizea semantic tableaux, ours is run in the HENKIN fashion (with modifications found in [7]). And, second, the semantics we employ is of the truth-value rather than the usual model-theoretic sort.') So truth-value assignments do duty for models, and the quantififiers are interpreted substitutionally.

Study of a presupposition-free variant of QKt, known as QK:, was begun in [8].