|
|||||||||||||||
|
For å registrere i Cristin må du være vitenskapelig eller administrativt ansatt.
|
|||||||||||||||
|
|||||||||||||||
|
|||||||||||||||
| Viser treff 1-3 av 3 |
|
2019
|
||
| 1. | Normann, Dag. The Computational Complexity of the Heine Borel Theorem. Homotopy Type Theory and Univalent Foundation; 2019-04-02 - 2019-04-02 UiO |
|
|
|
||
| 2. | Normann, Dag; Sanders, Sam. Computability Theory, Nonstandard Analysis, and Their Connections. Journal of Symbolic Logic (JSL) 2019 ;Volum 84.(4) s. 1422-1465 UiO |
|
|
|
||
| 3. | Normann, Dag; Sanders, Sam. The strength of compactness in Computability Theory and Nonstandard Analysis. Annals of Pure and Applied Logic 2019 ;Volum 170.(11) s. 1-42 UiO |
|