Relative enumerability and 1-genericity. - Wei Wang 150 (J. Symb. Log., 2011)

Selection by Recursively Enumerable Sets. - Wolfgang Merkle; Frank Stephan 001; Jason Teutsch; Wei Wang 150; Yue Yang 004 (TAMC, 2013)

Rainbow Ramsey Theorem for triples is strictly weaker than the Arithmetical Comprehension Axiom. - Wei Wang 150 (J. Symb. Log., 2013)

Cohesive sets and rainbows. - Wei Wang 150 (Ann. Pure Appl. Log., 2014)

The Definability strength of Combinatorial Principles. - Wei Wang 150 (J. Symb. Log., 2016)

Relative Definability of n-generics. - Wei Wang 150 (J. Symb. Log., 2018)

Growth and irreducibility in path-incompressible trees. - George Barmpalias; Wei Wang 150 (CoRR, 2022)

Randomness below complete theories of arithmetic. - George Barmpalias; Wei Wang 150 (Inf. Comput., 2023)

Pathwise-randomness and models of second-order arithmetic. - George Barmpalias; Wei Wang 150 (Inf. Comput., 2024)