# Proof-Theory and Semantics for a Theory of Definite Descriptions

Source: [Proof-Theory and Semantics for a Theory of Definite Descriptions](<https://www.sota2.com/research/paper/68fa585b1e209131ce9ad6e5>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T05:18:49.404Z

Authors: Nils K\\"urbis

Published: 2021-08-09T11:20:56.000Z

## Abstract

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two formulas. $Ix\[F, G\]$ means \`The $F$ is $G$'. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with $I$ and it is shown to be sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising \`the $F$' by a term forming operator. It does not coincide with Hintikka's and Lambert's preferred theories, but the divergence is well-motivated and attractive.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2108.03944>)

[PDF](<https://arxiv.org/pdf/2108.03944.pdf>)
