Interpreting higher computations as types with totality von Kristiansen, Lill, Normann, Dag

Wellfounded and non-wellfounded types of continuous functionals von Normann, Dag

On totality von Normann, Dag

Characterizing the continuous functionals von Normann, Dag

Recursion on the countable functionals von Normann, Dag

Inhaltsverzeichnis

The continuous functionals computations, recursions and degrees von Normann, Dag

Higher-order computability von Longley, John, Normann, Dag

Beschreibung

Higher-order computability von Longley, John, Normann, Dag

Volltext öffnen Volltext öffnen

Total objects in inductively defined types von Kristiansen, Lill, Normann, Dag

Set recursion and pi 1,2-logic von Girard, Jean-Yves 1947-, Normann, Dag

Effective cofinalities and admissibility von Griffor, Edward R., Normann, Dag

A non-standard treatment of the equation y' = f(y,t) von Birkeland, Bent, Normann, Dag

Hereditarily effective typestreams von Normann, Dag

A hierarchy of domains with totality, but without density von Normann, Dag

The recursion theory of Ptykes von Normann, Dag

Embeddability of Ptykes von Normann, Dag, Girard, Jean-Yves 1947-

Recursive enumerability and indexicality in E-recursion von Griffor, Edward R., Normann, Dag

Recursion on the Countable Functionals von Normann, Dag

Volltext öffnen