Enumerability. Decidability. Computability. An introduction to the theory of recursive functions. Translated by G.T. Herman and O. Plassman (Q5330638)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3203821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerability. Decidability. Computability. An introduction to the theory of recursive functions. Translated by G.T. Herman and O. Plassman |
scientific article; zbMATH DE number 3203821 |
Statements
1965
0 references
mathematical logic
0 references
Enumerability. Decidability. Computability. An introduction to the theory of recursive functions. Translated by G.T. Herman and O. Plassman (English)
0 references