Accepted papers to appear in LNCS proceedings

[1] Juan P. Aguilera, Robert S. Lubarsky, and Leonardo Pacheco. Higher-order feedback computation.
[2] Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, and
Sabrina Mantaci. Isometric sets of words and generalizations of the Fibonacci Cubes.
[3] Nikolay Bazhenov, Marta Fiori-Carones, and Manat Mustafa. On arithmetical numberings in
reverse mathematics. 
[4] Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra Soskova, and Stefan Vatev. Learning families of algebraic structures from text. 
[5] Jason Block. Complexities of theories of profinite subgroups of Sω via tree presentations.
[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.
[10] Andrés Cordón-Franco, F. Félix Lara-Martín, and Manuel J.S. Loureiro. Lipschitz determinacy
and arithmetic transfinite recursion.
[11] Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, and Siani Smith. Graph
homomorphism, monotone classes and bounded pathwidth.
[12] Ekaterina B. Fokina and Sebastiaan A. Terwijn. Computable structure theory of partial combinatory
algebras.
[13] Jun Le Goh, Arno Pauly, and Manlio Valenti. The weakness of finding descending sequences in
ill-founded linear orders.
[14] Ellen Hammatt. Structures of finite punctual dimension n > 2.
[15] Benjamin Hellouin de Menibus and Rémi Pallen. Two-player domino games.
[16] Henning Fernau, Lakshmanan Kuppusamy, and Indhumathi Raman. Counting simple rules in
semi-conditional grammars is not simple.
[17] Ruslan Kornev. On the group of computable automorphisms of the linear order of the reals.
[18] Lars Kristiansen and Juvenal Murwanashyaka. A weak first-order theory of sequences.
[19] Arno Pauly and Giovanni Soldà. Sequential discontinuity and first-order problems.
[20] Mikhail Peretyat’kin and Victor Selivanov. Universal Boolean algebras with applications to semantic
classes of models.
[21] Sam Sanders. On the computational properties of weak continuity notions.
[22] Eduardo Skapinakis. Recursion-theoretic alternation.
[23] Mikhail Starchak. Existential definability of unary predicates in Büchi arithmetic.
[24] Hong Hanh Tran and Guohua Wu. A diamond embedding theorem in the quotient structure
R/Ncup.
[25] Gunnar Wilken. Fundamental sequences based on localization.
[26] Tomoyuki Yamakami. Quantum first-order logics that capture logarithmic-time/space quantum
computability.