# A Binary Quantifier for Definite Descriptions for Cut Free Free Logics

Source: [A Binary Quantifier for Definite Descriptions for Cut Free Free Logics](<https://www.sota2.com/research/paper/68fa58641e209131ce9ae003>)

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

Data updated: 2025-10-25T15:19:34.786Z

Authors: Nils K\\"urbis

Published: 2021-08-22T16:44:02.000Z

## Abstract

This paper presents rules in sequent calculus for a binary quantifier $I$ to formalise definite descriptions: $Ix\[F, G\]$ means \`The $F$ is $G$'. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of $I$. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a term forming operator. In the final section rules for $I$ for negative free and classical logic are also mentioned.

## 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.09777>)

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