COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM von HARRISON-TRAINOR, MATTHEW, MELNIKOV, ALEXANDER, NG, KENG MENG

Volltext

CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES von GREENBERG, NOAM, NG, KENG MENG, WU, GUOHUA

Volltext

PUNCTUAL CATEGORICITY AND UNIVERSALITY von DOWNEY, ROD, GREENBERG, NOAM, MELNIKOV, ALEXANDER, NG, KENG MENG, TURETSKY, DANIEL

Volltext

Multiple genericity: a new transfinite hierarchy of genericity notions von McInerney, Michael, Ng, Keng Meng

Volltext

Difference randomness von Franklin, Johanna N. Y., Ng, Keng Meng

Volltext

UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS von ANDREWS, URI, LEMPP, STEFFEN, MILLER, JOSEPH S., NG, KENG MENG, SAN MAURO, LUCA, SORBI, ANDREA

Volltext

Computable soft separation axioms von Elsayed, S. M., Ng, Keng Meng

Volltext

The back-and-forth method and computability without delay von Melnikov, Alexander G., Ng, Keng Meng

Volltext

Foundations of Online Structure Theory II: The Operator Approach von Downey, Rod, Melnikov, Alexander, Ng, Keng Meng

Volltext

Splitting into degrees with low computational strength von Downey, Rod, Ng, Keng Meng

Volltext

Incomparability in local structures of s-degrees and Q-degrees von Chitaia, Irakli, Ng, Keng Meng, Sorbi, Andrea, Yang, Yue

Volltext

Jump inversions inside effectively closed sets and applications to randomness von Barmpalias, George, Downey, Rod, Ng, Keng Meng

Volltext

NOTES ON SACKS’ SPLITTING THEOREM von AMBOS-SPIES, KLAUS, DOWNEY, ROD G., MONATH, MARTIN, NG, KENG MENG

Volltext

Computably enumerable Turing degrees and the meet property von Durrant, Benedict, Lewis-Pye, Andy, Ng, Keng Meng, Riley, James

Volltext

Algebraic structures computable without delay von Kalimullin, Iskander, Melnikov, Alexander, Ng, Keng Meng

Volltext

Every \Delta ^0_2 Polish space is computable topological von Bazhenov, Nikolay, Melnikov, Alexander, Ng, Keng Meng

Volltext

A structure of punctual dimension two von Melnikov, Alexander, Ng, Keng Meng

Volltext

Every Δ02 Polish space is computable topological von Bazhenov, Nikolay, Melnikov, Alexander, Ng, Keng Meng

Volltext

COMPUTABLE LINEAR ORDERS AND PRODUCTS von FROLOV, ANDREY N., LEMPP, STEFFEN, NG, KENG MENG, WU, GUOHUA

Volltext

COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY von IANOVSKI, EGOR, MILLER, RUSSELL, NG, KENG MENG, NIES, ANDRÉ

Volltext