Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
CSL
2003
Springer
favorite
Email
discuss
report
79
views
Automated Reasoning
»
more
CSL 2003
»
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
14 years 4 months ago
Download
www.pps.jussieu.fr
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
Alexandre Miquel
Real-time Traffic
CSL 2003
|
Zermelo-Fraenkel Set Theory
|
claim paper
Related Content
»
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
more »
Post Info
More Details (n/a)
Added
06 Jul 2010
Updated
06 Jul 2010
Type
Conference
Year
2003
Where
CSL
Authors
Alexandre Miquel
Comments
(0)
Researcher Info
Automated Reasoning Study Group
Computer Vision