This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. I binds one variable and forms a formula from two formulas. Ix[F, G] means ‘The F is G’. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions recommended (...) here and the more usual approach that uses a term-forming operator ι, where ιxF means ‘the F’. (shrink)

We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of (...) varying strength. For all presented calculi a constructive cut elimination is provided. (shrink)