English

Definite Descriptions and Hybrid Tense Logic

Logic in Computer Science 2024-12-03 v1 Logic

Abstract

We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas. A particular theory of DD exploited here is essentially based on the approach of Russell, but with descriptions treated as genuine terms. However, the reductionist aspect of the Russellian approach is retained in several ways. Moreover, a special form of tense definite descriptions is formally developed. A constructive proof of the interpolation theorem for this calculus is given, which is an extension of the result provided by Blackburn and Marx.

Keywords

Cite

@article{arxiv.2412.01484,
  title  = {Definite Descriptions and Hybrid Tense Logic},
  author = {Andrzej Indrzejczak and Michał Zawidzki},
  journal= {arXiv preprint arXiv:2412.01484},
  year   = {2024}
}
R2 v1 2026-06-28T20:19:42.011Z