[10] Andrés Cordón-Franco, F. Félix Lara-Martín, and Manuel J.S. Loureiro. Lipschitz determinacy and arithmetic transfinite recursion.

[5] Jason Block. Complexities of theories of profinite subgroups of Sω via tree presentations.

[22] Eduardo Skapinakis. Recursion-theoretic alternation.

[18] Lars Kristiansen and Juvenal Murwanashyaka. A weak first-order theory of sequences.

[12] Ekaterina B. Fokina and Sebastiaan A. Terwijn. Computable structure theory of partial combinatory algebras.

[26] Tomoyuki Yamakami. Quantum first-order logics that capture logarithmic-time/space quantum computability.

[3] Nikolay Bazhenov, Marta Fiori-Carones, and Manat Mustafa. On arithmetical numberings in reverse mathematics. (Online)

[2] Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, and Sabrina Mantaci. Isometric sets of words and generalizations of the Fibonacci Cubes.

[1] Juan P. Aguilera, Robert S. Lubarsky, and Leonardo Pacheco. Higher-order feedback computation.

[6] Caleb M.H. Camrud and Timothy H. McNicholl. Hyperarithmetic numerals.

[7] Domenico Cantone, Andrea De Domenico, and Pietro Maugeri. The decision problem for undirected graphs with reachability and acyclicity.

[8] Merlin Carl. Almost sure OTM-realizability.

[9] Chris J. Conidis. The theory of Hilbert’s Basis Theorem for multivariate polynomials over rings.

[11] Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, and Siani Smith. Graph homomorphism, monotone classes and bounded pathwidth.

[21] Sam Sanders. On the computational properties of weak continuity notions.