Computability in Europe 2006
Logical Approaches to Computational Barriers


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


Speaker: Vadim Puzarenko
Slot: Array, 17:40-18:00, 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