A Normalizing Intuitionistic Set Theory with Inaccessible Sets

DOI10.2168/LMCS-3(3:6)2007zbMath1125.03038OpenAlexW2030843104MaRDI QIDQ5426072

Wojciech Moczydłowski

Publication date: 15 November 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-3(3:6)2007

zbMATH Keywords

normalizationaxiomatizationCurry-Howard isomorphismimpredicative constructive version of Zermelo-Fraenkel set theory with Replacement and \(\omega \)-many inaccessiblesweakly-normalizing typed lambda calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Nonclassical and second-order set theories (03E70) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Unifying sets and programs via dependent types ⋮ Unifying Sets and Programs via Dependent Types

Uses Software

• Coq
• Nuprl
• LEGO

This page was built for publication: A Normalizing Intuitionistic Set Theory with Inaccessible Sets