| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Analog networks on function data streams
|
Poças, Diogo
|
|
2018
|
|
4 |
p. 301-322
|
artikel
|
| 2 |
Coloring the rationals in reverse mathematics
|
Frittaion, Emanuele
|
|
2017
|
|
4 |
p. 319-331
|
artikel
|
| 3 |
Computability and categoricity of weakly ultrahomogeneous structures
|
Adams, Francis
|
|
2017
|
|
4 |
p. 365-389
|
artikel
|
| 4 |
Computable copies of ℓp1
|
McNicholl, Timothy H.
|
|
2017
|
|
4 |
p. 391-408
|
artikel
|
| 5 |
Computational complexity and the conjugacy problem
|
Miasnikov, Alexei
|
|
2017
|
|
4 |
p. 307-318
|
artikel
|
| 6 |
Degrees of relations on ordinals
|
Wright, Matthew
|
|
2018
|
|
4 |
p. 349-365
|
artikel
|
| 7 |
Effectively infinite classes of numberings and computable families of reals
|
Faizrahmanov, Marat
|
|
|
|
4 |
p. 339-350
|
artikel
|
| 8 |
Effectivity and reducibility with ordinal Turing machines
|
Carl, Merlin
|
|
|
|
4 |
p. 289-304
|
artikel
|
| 9 |
Expressiveness, meanings and machines
|
Davidson, Joe
|
|
2018
|
|
4 |
p. 367-394
|
artikel
|
| 10 |
How much partiality is needed for a theory of computability?
|
Spreen, Dieter
|
|
|
|
4 |
p. 371-426
|
artikel
|
| 11 |
Intermediate intrinsic density and randomness
|
Miller, Justin
|
|
|
|
4 |
p. 327-341
|
artikel
|
| 12 |
Inversion operations in algebraic structures
|
Alaev, Pavel
|
|
|
|
4 |
p. 315-322
|
artikel
|
| 13 |
Nonlowness is independent from fickleness
|
Ko, Liling
|
|
|
|
4 |
p. 271-288
|
artikel
|
| 14 |
Notes on overt choice
|
Hoyrup, Mathieu
|
|
|
|
4 |
p. 351-369
|
artikel
|
| 15 |
On the main scientific achievements of Victor Selivanov
|
Bazhenov, Nikolay
|
|
|
|
4 |
p. 301-314
|
artikel
|
| 16 |
Partial orders and immunity in reverse mathematics
|
Patey, Ludovic
|
|
2018
|
|
4 |
p. 323-339
|
artikel
|
| 17 |
Preface
|
Bazhenov, Nikolay
|
|
|
|
4 |
p. 299
|
artikel
|
| 18 |
Punctually presented structures I: Closure theorems
|
Dorzhieva, Marina
|
|
|
|
4 |
p. 323-337
|
artikel
|
| 19 |
Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
|
BeMent, Zach
|
|
|
|
4 |
p. 343-354
|
artikel
|
| 20 |
The Σ2 theory of Dh(⩽hO) as an uppersemilattice with least and greatest element is decidable
|
Barnes, James
|
|
|
|
4 |
p. 305-325
|
artikel
|
| 21 |
Transfinite Ford–Fulkerson on a finite network
|
Backman, Spencer
|
|
2018
|
|
4 |
p. 341-347
|
artikel
|
| 22 |
Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set
|
Milchior, Arthur
|
|
2017
|
|
4 |
p. 333-363
|
artikel
|
Tijdschrift beschrijving