Computational Hardness of Validity in Probability Logic. - Rutger Kuyper (LFCS, 2013)

Natural factors of the Muchnik lattice capturing IPC. - Rutger Kuyper (Ann. Pure Appl. Log., 2013)

Model Theory of Measure Spaces and Probability Logic. - Rutger Kuyper; Sebastiaan A. Terwijn (Rev. Symb. Log., 2013)

Natural factors of the Medvedev lattice capturing IPC. - Rutger Kuyper (Arch. Math. Log., 2014)

Effective genericity and differentiability. - Rutger Kuyper; Sebastiaan Terwijn (J. Log. Anal., 2014)

Computational aspects of satisfiability in probability logic. - Rutger Kuyper (Math. Log. Q., 2014)

First-Order Logic in the Medvedev Lattice. - Rutger Kuyper (Stud Logica, 2015)

Coarse Reducibility and Algorithmic Randomness. - Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Rutger Kuyper; Paul E. Schupp (J. Symb. Log., 2016)

Nondensity of Double Bubbles in the D.C.E. Degrees. - Uri Andrews; Rutger Kuyper; Steffen Lempp; Mariya Ivanova Soskova; Mars M. Yamaleev (Computability and Complexity, 2017)

Parallel and Serial Jumps of Weak Weak König's Lemma. - Laurent Bienvenu; Rutger Kuyper (Computability and Complexity, 2017)

Monte Carlo Computability. - Vasco Brattka; Rupert Hölzl 001; Rutger Kuyper (STACS, 2017)

Nullifying randomness and genericity using symmetric difference. - Rutger Kuyper; Joseph S. Miller (Ann. Pure Appl. Log., 2017)

On Weihrauch Reducibility and intuitionistic Reverse Mathematics. - Rutger Kuyper (J. Symb. Log., 2017)

Statman's Hierarchy Theorem. - Bram Westerbaan; Bas Westerbaan; Rutger Kuyper; Carst Tankink; Remy Viehoff; Henk Barendregt (Log. Methods Comput. Sci., 2017)

Cardinal invariants, non-lowness classes, and Weihrauch reducibility. - Noam Greenberg; Rutger Kuyper; Dan Turetsky (Comput., 2019)

Levels of Uniformity. - Rutger Kuyper (Notre Dame J. Formal Log., 2019)

Expanding the Reals by continuous Functions Adds no Computational Power. - Uri Andrews; Julia F. Knight; Rutger Kuyper; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)