𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coquand's calculus of constructions: A mathematical foundation for a proof development system

✍ Scribed by Jonathan P. Seldin

Publisher
Springer
Year
1992
Tongue
English
Weight
906 KB
Volume
4
Category
Article
ISSN
0934-5043

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A constructive proof of Craig's interpol
A constructive proof of Craig's interpolation lemma for m-valued logic
✍ Anita Waselewska πŸ“‚ Article πŸ“… 1979 πŸ› Springer Netherlands 🌐 English βš– 437 KB

The a]gebraie proof of CrMg's interpolation lemma for m-valued logic was given by Rasiowa in [i]. We present here a constructive proof of this lemma, based on a Gentzen type formMization. :Let J be the set oi all formulas oi m-valued predicate calculus. We assume that our language does not contain

Is ZF a hack?: Comparing the complexity
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
✍ Freek Wiedijk πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 315 KB

This paper presents Automath encodings (which are also valid in LF/Ξ»P ) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to find out which foundation is the simplest. The systems analyzed in this way are two kinds of set theory (ZFC and NF),