Actuality in Propositional Modal Logic. - Allen P. Hazen; Benjamin G. Rin; Kai Frederick Wehmeier (Stud Logica, 2013)

The computational strengths of α-tape infinite time Turing machines. - Benjamin G. Rin (Ann. Pure Appl. Log., 2014)

Transfinite recursion and computation in the iterative conception of set. - Benjamin G. Rin (Synth., 2015)

Realizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction. - Benjamin G. Rin; Sean Walsh 001 (Rev. Symb. Log., 2016)

Koepke Machines and Satisfiability for Infinitary Propositional Languages. - Merlin Carl; Benedikt Löwe; Benjamin G. Rin (CiE, 2017)

Writability and reachability for alpha-tape infinite time Turing machines. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (CoRR, 2018)

Reachability for infinite time Turing machines with long tapes. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (Log. Methods Comput. Sci., 2020)

Hamiltonian Paths and Cycles in NP-Complete Puzzles. - Marnix Deurloo; Mitchell Donkers; Mieke Maarse; Benjamin G. Rin; Karen Schutte (FUN, 2024)

Arimaa Is PSPACE-Hard. - Benjamin G. Rin; Atze Schipper (FUN, 2024)