Descriptions in mathematical logic
If A(x) is a predicate satisfied by exactly one x, then we write Ix.A(x) for that object x. The operator I is called a descriptor. The author reviews the various treatments of descriptors in the literature, pointing out that the problem each treatment faces is what to do with Ix.A(x) when \(\exists !xA(x)\) is not (yet) known. The obvious answer is that it is undefined. The technical contribution of the paper is to show that this obvious answer can be formalized. The author bases his formalization on Scott's E-logic, and shows that partial descriptors can be added to such a theory conservatively. In a final section, he considers theories with function variables and quantification. In that case descriptors are not conservative, since they yield axioms of choice; but he shows that is all they yield. The paper is very clearly written and to the point.
- Definite descriptions in intuitionist positive free logic
- scientific article; zbMATH DE number 3934996
- On the role of description
- Two treatments of definite descriptions in intuitionist negative free logic
- A binary quantifier for definite descriptions in intuitionist negative free logic: natural deduction and normalisation
- Axiomatic set theory. With a historical introduction by Abraham A. Fraenkel
- Formalized recursive functionals and formalized realizability
- scientific article; zbMATH DE number 3650529 (Why is no real title available?)
- scientific article; zbMATH DE number 3484001 (Why is no real title available?)
- scientific article; zbMATH DE number 3503198 (Why is no real title available?)
- scientific article; zbMATH DE number 3198017 (Why is no real title available?)
This page was built for publication: Descriptions in mathematical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071018)