Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4661862 | Annals of Pure and Applied Logic | 2013 | 7 Pages |
Abstract
We prove a generalization of the hyper-game theorem by using an abstract version of inductively generated formal topology. As applications we show proofs for Cantor theorem, uncountability of the set of functions from N to N and Gödel theorem which use no diagonal argument.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic