In this thesis, we develop four systems of set theory based on linear logic. All of those systems have the principle of unrestricted comprehension but they are shown to be consistent. The consitency proofs are given by establishing the cut-elimination theorems. Our first system of linear set theory SMALL is formulated in full linear logic, i.e., with exponentials. However we do not allow exponentials to appear inside of set terms. Secondly, we formulate a system of set theory in linear logic with infinitary additive conjunction and disjunction, instead of exponentials. This system is called AS 1 . Thirdly, we present the system of linear set theory LZF which is a conservative extension of Zermelo-Fraenkel set theory without the axiom of regularity or ZF \Gamma . The idea is to build up a linear set theory on top of ZF \Gamma in a style similar to SMALL. We establish a partial cut-elimination result for LZF, and derive from it that LZF is a conservative extension of ZF \Gamma , ..
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.