nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
|
Lerman, M. |
|
1998 |
94 |
1-3 |
p. 143-180 38 p. |
artikel |
2 |
Applications of cut-free infinitary derivations to generalized recursion theory
|
Beckmann, Arnold |
|
1998 |
94 |
1-3 |
p. 7-19 13 p. |
artikel |
3 |
Author index volume 94 (1998)
|
|
|
1998 |
94 |
1-3 |
p. 297- 1 p. |
artikel |
4 |
Coding a family of sets
|
Knight, J.F. |
|
1998 |
94 |
1-3 |
p. 127-142 16 p. |
artikel |
5 |
Decidable Boolean algebras of low level
|
Goncharov, S.S. |
|
1998 |
94 |
1-3 |
p. 75-95 21 p. |
artikel |
6 |
Definable properties of the computably enumerable sets
|
Harrington, Leo |
|
1998 |
94 |
1-3 |
p. 97-125 29 p. |
artikel |
7 |
Editorial Board
|
|
|
1998 |
94 |
1-3 |
p. ii- 1 p. |
artikel |
8 |
Extending partial orders to dense linear orders
|
Slaman, Theodore A. |
|
1998 |
94 |
1-3 |
p. 253-261 9 p. |
artikel |
9 |
Feasible graphs with standard universe
|
Cenzer, Douglas |
|
1998 |
94 |
1-3 |
p. 21-35 15 p. |
artikel |
10 |
Finite notations for infinite terms
|
Schwichtenberg, Helmut |
|
1998 |
94 |
1-3 |
p. 201-222 22 p. |
artikel |
11 |
Inaccessibility in constructive set theory and type theory
|
Rathjen, Michael |
|
1998 |
94 |
1-3 |
p. 181-200 20 p. |
artikel |
12 |
Lattice representations for computability theory
|
Fejer, Peter A. |
|
1998 |
94 |
1-3 |
p. 53-74 22 p. |
artikel |
13 |
Learning via queries and oracles
|
Stephan, Frank |
|
1998 |
94 |
1-3 |
p. 273-296 24 p. |
artikel |
14 |
Participants and titles of lectures
|
|
|
1998 |
94 |
1-3 |
p. 3-6 4 p. |
artikel |
15 |
Preface
|
Ambos-Spies, Klaus |
|
1998 |
94 |
1-3 |
p. 1- 1 p. |
artikel |
16 |
Sets of generators and automorphism bases for the enumeration degrees
|
Sorbi, Andrea |
|
1998 |
94 |
1-3 |
p. 263-272 10 p. |
artikel |
17 |
Splitting theorems and the jump operator
|
Downey, R.G. |
|
1998 |
94 |
1-3 |
p. 45-52 8 p. |
artikel |
18 |
The dense simple sets are orbit complete with respect to the simple sets
|
Cholak, Peter |
|
1998 |
94 |
1-3 |
p. 37-44 8 p. |
artikel |
19 |
Weak presentations of non-finitely generated fields
|
Shlapentokh, Alexandra |
|
1998 |
94 |
1-3 |
p. 223-252 30 p. |
artikel |