Accepted Papers

Invited Papers

• The  CDSAT  Method  for  Satisfiability  Modulo  Theories  and Assignment: an Exposition

Maria Paola Bonacina

• Effective second countability in computable analysis

Vasco  Brattka  and  Emmanuel  Rauzy

• Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program

Alejandro D´ıaz-Caro

• Represented spaces of represented spaces

Johanna Franklin, Eike Neumann, Arno Pauly, C´ecilia Pradic and Manlio Valenti

• Computation with Real Numbers and Continuous-Time Dynamical Systems

Daniel Graça

• Proof-Carrying Neuro-Symbolic Code

Ekaterina Komendantskaya

• Uniform Functional Interpretations

Paulo Oliva

• Computable Analysis for Extraction of Certified Programs and its Applications

Holger Thies

Contributed papers

• The existence of primitive recursive structure

Pavel Alaev

• Space-bounded online Kolmogorov complexity is additive

Bruno Bauwens and Maria Marchenko

• On learning existentially definable subsets in a computable structure

Nikolay Bazhenov and Manat Mustafa

• Transfinite structured programming

Siddharth Bhaskar

• Computability of Real Functions with Oracle Pointer Machines implies Real-Time simulation of Chemical Reaction Networks

Saptarshi Biswas

• Computability of Initial Value Problems

Vasco Brattka and Hendrik Smischliaew

• Full generalized effective reducibility

Merlin Carl

• On S-Degrees of some Representations of Irrational Numbers

Ivan Georgiev and Lars Kristiansen

• Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs

Aliénor Goubault-Larrecq and Kévin Perrot

• Binary Expansions of Regular Reals and Reordered Computable Numbers

Peter Hertling and Philip Janicki

• Properties of Range Sets of Continuous Functions in Reverse Mathematics

Corrie Ingall

• The theory of reachability of trace-pushdown systems

Dietrich Kuske

• A point to set principle for finite-state dimension

Elvira Mayordomo

• Some structural complexity results for $\exists \mathbb R$

Klaus Meer and Adrian Wurm

• On the computational power of C-random strings

Alexey Milovanov

• Generalized learnability of stochastic principles

Morenikeji Neri, Nicholas Pischke and Thomas Powell

• Computably discrete represented spaces

Eike Neumann, Arno Pauly, Cécilia Pradic and Manlio Valenti

• Multidimensional tilings and MSO logic

Rémi Pallen and Ilkka Torma

• Injectivity of polynomials over finite discrete dynamical systems

Antonio E. Porreca and Marius Rolland

• Injectivity of polynomials over finite discrete dynamical systems

Antonio E. Porreca and Marius Rolland

• Weihrauch problems as containers

Cécilia Pradic and Ian Price

• On the reverse mathematics of cut-elimination and determinacy

Philipp Provenzano

• $L {\omega\omega}$, $L {\omega 1\omega}$, and Wadge hierarchy

Victor Selivanov

• Ordinal Invariants of the $h$-Preorder on $k$-Labeled Forests

Victor Selivanov and Ilya Smirnov

• Completeness theorems for modal logic in second-order arithmetic

Sho Shimomichi, Yuto Takeda and Keita Yokoyama

• Variants of Solovay reducibility

Ivan Titov

• Constructive Analysis of Maximal Ideals in Z[X] by the Material Interpretation

Franziskus Wiesnet

• Alternation-Bounded Semi-Unbounded Fan-in Cascading Circuits and the Complementation Closure Property

Tomoyuki Yamakami