- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Undergraduate Research /
- Eliminability of definite descriptions
Open Collections
UBC Undergraduate Research
Eliminability of definite descriptions Rashidi, Kiana
Abstract
Judgemental First-Order Zermelo-Fraenkel Set Theory with Descriptions (JZF)[3], is a rigorous formalization of constructive set theory. JZF includes a natural deduction system for first-order logic extended with the axioms of an intuitionistic set theory (Intuitionistic Zermelo-Fraenkel set theory [1, 6]). The system is extended by the set elementhood binary relation as well as definite descriptions [8, 9]. Definite descriptions make it possible to concisely and directly reason about sets that are uniquely identified by a specific property. However, these descriptions are not a necessary part of the system. Thus, we must be able to eliminate definite descriptions from JZF by translating all propositions that use them into equivalent ones that do not. Furthermore, we must ensure that all propositions that are derivable in JZF remain derivable when translated. In this thesis, we prove the metatheorem that definite descriptions are eliminable. First, we provide a translation from propositions in JZF to a new system: one that uses the subset of JZF rules that do not contain definite descriptions. Then, we prove that the corresponding translations of propositions that are derivable in JZF are derivable in the system without definite descriptions.
Item Metadata
Title |
Eliminability of definite descriptions
|
Creator | |
Date Issued |
2025-04
|
Description |
Judgemental First-Order Zermelo-Fraenkel Set Theory with Descriptions (JZF)[3], is a rigorous
formalization of constructive set theory. JZF includes a natural deduction system for first-order
logic extended with the axioms of an intuitionistic set theory (Intuitionistic Zermelo-Fraenkel set
theory [1, 6]). The system is extended by the set elementhood binary relation as well as definite
descriptions [8, 9]. Definite descriptions make it possible to concisely and directly reason about
sets that are uniquely identified by a specific property. However, these descriptions are not a necessary part of the system. Thus, we must be able to eliminate definite descriptions from JZF by
translating all propositions that use them into equivalent ones that do not. Furthermore, we must
ensure that all propositions that are derivable in JZF remain derivable when translated.
In this thesis, we prove the metatheorem that definite descriptions are eliminable. First, we provide a translation from propositions in JZF to a new system: one that uses the subset of JZF rules
that do not contain definite descriptions. Then, we prove that the corresponding translations of
propositions that are derivable in JZF are derivable in the system without definite descriptions.
|
Genre | |
Type | |
Language |
eng
|
Series | |
Date Available |
2025-05-23
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0448939
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Undergraduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International