Computability in Europe 2006
Logical Approaches to Computational Barriers
|Slot:||Mon, 10:30-10:50, Faraday B (col. 2)|
This article considers two alternative and formal weaker forms of Fullness, one of the axioms of constructive Zermelo--Fraenkel set theory. The relation to other axioms is analysed and some results that previously invoked Fullness are shown to be provable with the weaker forms too, sometimes even more easily.
|websites: Arnold Beckmann||2006-04-19|