Hierarchies of constructible sets
β Scribed by Keith J. Devlin
- Publisher
- Elsevier Science
- Year
- 1977
- Weight
- 413 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0003-4843
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This article discusses the problem of constructing robust class libraries. Further design criteria include the flexibility of class libraries, the efficiency of the implementations, and their safe extensibility. We show that it is possible to design robust libraries to satisfy any two of the require
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof of the fundamental theorem of algebra has been formalized in Coq. The algebraic hierarchy that is described here is both
## Abstract We give a simple and elementary proof of the following result of Girard and Vauzeilles which is proved in [5]: βThe binary Veblen function Ο: __On Γ On β On__ is a dilator.β Our proof indicates the intimate connection between the traditional theory of ordinal notation systems and Girard
## Abstract We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell (see [5]) in order to prove that the universe of ZFA can also be obtained (without appealing to choice) as the least
has proposed a new axiomatic set theory, see [5], [4], and [3]. The nonlogical axioms of this theory are as follows: A2. Existence of a greatest lower set (gls A(%)):