Abstract is missing.
- If CiE Did Not Exist, It Would Be Necessary to Invent ItS. Barry Cooper. 3-9 [doi]
- Some Open Questions and Recent Results on Computable Banach SpacesRod Downey, Noam Greenberg, Long Qian. 10-26 [doi]
- Kolmogorov Complexity as a Combinatorial ToolAlexander Shen. 27-31 [doi]
- Cellular Automata: Communication MattersMartin Kutrib, Andreas Malcher. 32-43 [doi]
- Membership Problems in Infinite GroupsMarkus Lohrey. 44-59 [doi]
- Communication ModalitiesRoman Kuznets. 60-71 [doi]
- Algorithmic Aspects of Left-Orderings of Solvable Baumslag-Solitar Groups via its Dynamical RealizationMeng-Che, Khanh Le, Dino Rossegger. 72-84 [doi]
- Hybrid Maximal Filter SpacesDavid Gonzalez. 85-99 [doi]
- Inversion in P-Computable FieldsPavel Alaev. 100-109 [doi]
- On the Computational Properties of Weak Continuity NotionsSam Sanders. 113-125 [doi]
- On Arithmetical Numberings in Reverse MathematicsNikolay Bazhenov 0001, Marta Fiori-Carones, Manat Mustafa. 126-138 [doi]
- Two-Player Domino GamesBenjamin Hellouin de Menibus, Rémi Pallen. 139-152 [doi]
- Almost Sure OTM-RealizabilityMerlin Carl. 153-165 [doi]
- Learning Families of Algebraic Structures from TextNikolay Bazhenov 0001, Ekaterina B. Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev. 166-178 [doi]
- Structures of Finite Punctual Dimension n>2Ellen Hammatt. 179-191 [doi]
- Counting Simple Rules in Semi-conditional Grammars is not SimpleHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. 192-204 [doi]
- Universal Boolean Algebras with Applications to Semantic Classes of ModelsMikhail G. Peretyat'kin, Victor L. Selivanov. 205-217 [doi]
- Existential Definability of Unary Predicates in Büchi ArithmeticMikhail R. Starchak. 218-232 [doi]
- Graph Homomorphism, Monotone Classes and Bounded PathwidthTala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith. 233-251 [doi]
- Recursion-Theoretic AlternationEduardo Skapinakis. 252-264 [doi]
- Computable Structure Theory of Partial Combinatory AlgebrasEkaterina B. Fokina, Sebastiaan A. Terwijn. 265-276 [doi]
- Hyperarithmetic NumeralsCaleb Camrud, Timothy H. McNicholl. 277-284 [doi]
- Lipschitz Determinacy and Arithmetic Transfinite RecursionAndrés Cordón-Franco, Francisco Félix Lara Martín, Manuel J. S. Loureiro. 285-297 [doi]
- Higher-Order Feedback ComputationJuan P. Aguilera 0001, Robert S. Lubarsky, Leonardo Pacheco. 298-310 [doi]
- Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum ComputabilityTomoyuki Yamakami. 311-323 [doi]
- Fundamental Sequences Based on LocalizationGunnar Wilken. 324-338 [doi]
- The Weakness of Finding Descending Sequences in Ill-Founded Linear OrdersJun Le Goh, Arno Pauly, Manlio Valenti. 339-350 [doi]
- Sequential Discontinuity and First-Order ProblemsArno Pauly, Giovanni Soldà. 351-365 [doi]
- ømega via Tree PresentationsJason Block. 366-376 [doi]
- On the Existence of Infinite Monomial Division Chains with Finitely Many IndeterminatesChris J. Conidis. 377-389 [doi]
- A Weak First-Order Theory of SequencesLars Kristiansen, Juvenal Murwanashyaka. 390-404 [doi]
- On the Group of Computable Automorphisms of the Linear Order of the RealsRuslan Kornev. 405-419 [doi]
- A Diamond Embedding Theorem in the Quotient Structure bfR/NCupHong Hanh Tran, Guohua Wu. 420-430 [doi]
- The Decision Problem for Undirected Graphs with Reachability and AcyclicityDomenico Cantone, Andrea De Domenico, Pietro Maugeri. 431-446 [doi]
- Isometric Sets of Words and Generalizations of the Fibonacci CubesMarcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci. 447-460 [doi]