Advertisement

The System Kt of Minimal Tense Logic

  • Nicholas Rescher
  • Alasdair Urquhart
Part of the LEP Library of Exact Philosophy book series (LEP, volume 3)

Abstract

We come now to the problem of devising a “tense logic” — that is, a set of rules governing the mutual logical interrelationships of the tense operators as defined within the framework of a (R/U)-calculus. Let us begin here with the question of an irreducibly basic or minimal tense logic; “minimal” in the sense of involving no assumptions whatsoever regarding the nature of the U-relation. This last condition is imposed to assure “minimality” in the sense of topological neutrality — i. e., the lack of any specific assumptions about the structure of time.

Keywords

Completeness Proof Minimal System Tense Operator Tense Logic Reductio Argument 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag/Wien 1971

Authors and Affiliations

  • Nicholas Rescher
    • 1
  • Alasdair Urquhart
    • 1
  1. 1.PittsburghUSA

Personalised recommendations