Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
Definability of the Field of Reals in Admissible Sets

Speaker: Vadim Puzarenko
Slot: Sat, 17:40-18:00, Faraday B (col. 1)

Abstract

Criteria of definability and (in some wide class) effective
definability of the field of reals in admissible sets are found in
terms of definable collections of naturals. 


websites: Arnold Beckmann 2006-04-19 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net