Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
This paper gives simple saturated sets for disjunction and second-order existential quantification by using the idea of segments in Prawitz’s strong validity. Saturated sets for disjunction are defined by Pi-0-1 comprehension and those for second-order existential quantification are defined by Sigma-1-1 comprehension. Saturated-set semantics and a simple strong normalization proof are given to the system with disjunction, second-order existential quantification, and their permutative conversions. This paper also introduces the contraction property to saturated sets, which gives us saturated sets closed under union. This enables us to have saturated-set semantics for the system with union types, second-order existential types, and their permutative conversions, and prove its strong normalization.
Unable to display preview. Download preview PDF.
- Prawitz, D.: Natural Deduction. Almquist and Wiksell (1965)Google Scholar
- Prawitz, D.: Ideas and results of proof theory. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Logic Symposium, pp. 235–307. North-Holland, Amsterdam (1971)Google Scholar
- Tatsuta, M., Dezani-Ciancaglini, M.: Normalisation is Insensible to lambda-term Identity or Difference. lambda-term Identity or Difference. In: Proceedings of Twenty First Annual IEEE Symposium on Logic in Computer Science, pp. 327–336 (2006)Google Scholar