Computability in Europe 2006
Logical Approaches to Computational Barriers
|Slot:||Sat, 17:20-17:40, Faraday B (col. 1)|
We consider a problem of inner constructivizability of admissible sets by means of elements of a bounded rank. For hereditary finite superstructures we find the precise estimates of the rank of inner constructivizability: it is equal to $\omega$ for superstructures over finite structures and less or equal to 2 otherwise. We introduce examples of hereditary finite superstructures with ranks 0, 1, 2. It is shown that hereditary finite superstructure over the field of real numbers has rank 1.
|websites: Arnold Beckmann||
Warning: date(): It is not safe to rely on the system's timezone settings. You are *required* to use the date.timezone setting or the date_default_timezone_set() function. In case you used any of those methods and you are still getting this warning, you most likely misspelled the timezone identifier. We selected the timezone 'UTC' for now, but please set date.timezone to select your timezone. in /srv/www/htdocs-cs/cie06/conf-code.php on line 135