Gå direkte til innholdet
Definability and Computability
Spar

Definability and Computability

Forfatter:
innbundet, 1996
Engelsk
Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development.
Opplag
1996 ed.
ISBN
9780306110399
Språk
Engelsk
Vekt
446 gram
Utgivelsesdato
30.4.1996
Antall sider
264