Hostname: page-component-76fb5796d-2lccl Total loading time: 0 Render date: 2024-04-27T19:42:18.728Z Has data issue: false hasContentIssue false

Semantic analysis of tense logics1

Published online by Cambridge University Press:  12 March 2014

S. K. Thomason*
Affiliation:
Simon Fraser University, Burnaby 2, British Columbia, Canada

Extract

Although we believe the results reported below to have direct philosophical import, we shall for the most part confine our remarks to the realm of mathematics. The reader is referred to [4] for a philosophically oriented discussion, comprehensible to mathematicians, of tense logic.

The “minimal” tense logic T0 is the system having connectives ∼, →, F (“at some future time”), and P (“at some past time”); the following axioms:

(where G and H abbreviate ∼F∼ and ∼P∼ respectively); and the following rules:

(8) from α and α → β, infer β,

(9) from α, infer any substitution instance of α,

(10) from α, infer ,

(11) from α, infer .

A tense logic is a system T whose language is that of T0 and whose axioms and rules include (1)–(11). The axioms and rules of T other than (1)–(11) are called proper axioms and rules.

We shall investigate three systems of semantics for tense logics, i.e. three notions of structure and three relations ⊧ which stand between structures and formulas. One reads α as “α is valid in .” A structure is a model of a tense logic T if every formula provable in T is valid in . A semantics is adequate for T if the set of models of T in the semantics is characteristic for T, i.e. if whenever T ∀ α then there is a model of T in the semantics such that ∀ α. Two structures and , possibly from different semantics, are called equivalent () if exactly the same formulas are valid in as in .

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

This work was supported by the National Research Council of Canada, grant #A-4065, and was contributed to the Tarski Symposium, Berkeley, June, 1971.

References

REFERENCES

[1]Harrop, Ronald, Some structure results for propositional calculi, this Journal, vol. 30 (1965), pp. 271292.Google Scholar
[2]Jónsson, Bjarni and Tarski, Alfred, Boolean algebras with operators. I, American Journal of Mathematics, vol. 73 (1951), pp. 891939.CrossRefGoogle Scholar
[3]McKinsey, J. C. C. and Tarski, Alfred, Some theorems about the sentential calculi of Lewis and Heyting, this Journal, vol. 13 (1948), pp. 115.Google Scholar
[4]Prior, A. N., Past, Present and Future, Clarendon Press, Oxford, 1967.CrossRefGoogle Scholar
[5]Fine, Kit, Propositional quantifiers in modal logic, Theoria, vol. 36 (1970), pp. 336346.CrossRefGoogle Scholar
[6]Makinson, David, A generalisation of the concept of a relational model for modal logic, Theoria, vol. 36 (1970), pp. 330335.CrossRefGoogle Scholar
[7]Thomason, S. K., An incompleteness theorem in modal logic, Theoria, (to appear).Google Scholar