Gå direkt till innehållet
Definability and Computability
Spara

Definability and Computability

Författare:
inbunden, 1996
Engelska
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.
Författare
Yuri L. Ershov
Upplaga
1996 ed.
ISBN
9780306110399
Språk
Engelska
Vikt
446 gram
Utgivningsdatum
30.4.1996
Sidor
264