Abstract is missing.
- Calculating the Mind Change Complexity of Learning Algebraic StructuresNikolay Bazhenov, Vittorio Cipriani, Luca San Mauro. 1-12 [doi]
- Well-Orders Realized by C.E. Equivalence RelationsNikolay Bazhenov, Maxim V. Zubkov. 13-23 [doi]
- Maximal Ideals in Countable Rings, ConstructivelyIngo Blechschmidt, Peter Schuster 0001. 24-38 [doi]
- Programming with Ordinary Differential Equations: Some First Steps Towards a Programming LanguageOlivier Bournez. 39-51 [doi]
- A Game-Theoretic Approach for the Synthesis of Complex SystemsVéronique Bruyère. 52-63 [doi]
- Lower Bounds on β (α )Merlin Carl. 64-73 [doi]
- Proof Complexity of Monotone Branching ProgramsAnupam Das 0002, Avgerinos Delkos. 74-87 [doi]
- Enumerating Classes of Effective Quasi-Polish SpacesMatthew de Brecht, Takayuki Kihara, Victor L. Selivanov. 88-102 [doi]
- Maps of Restrictions for Behaviourally Correct LearningVanja Doskoc, Timo Kötzing. 103-114 [doi]
- An Extension of the Equivalence Between Brouwer's Fan Theorem and Weak König's Lemma with a Uniqueness HypothesisMakoto Fujiwara. 115-124 [doi]
- Defining Long Words Succinctly in FO and MSOLauri Hella, Miikka Vilander. 125-138 [doi]
- Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation MeetMaría Dolores Jiménez-López. 139-150 [doi]
- Strong Medvedev Reducibilities and the KL-Randomness ProblemBjørn Kjos-Hanssen, David J. Webb. 151-161 [doi]
- On the Necessity of Some Topological SpacesRobert S. Lubarsky. 162-171 [doi]
- On the Compatibility Between the Minimalist Foundation and Constructive Set TheorySamuele Maschio, Pietro Sabelli. 172-185 [doi]
- Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading ProcessesKitty Meeks. 186-195 [doi]
- Hilbert's Tenth Problem for Term Algebras with a Substitution OperatorJuvenal Murwanashyaka. 196-207 [doi]
- Weak Sequential Theories of Finite Full Binary TreesJuvenal Murwanashyaka. 208-219 [doi]
- On Envelopes and Backward ApproximationsEike Neumann. 220-233 [doi]
- On Trees Without Hyperimmune BranchesKeng Meng Ng, Frank Stephan 0001, Yue Yang, Liang Yu. 234-245 [doi]
- Algebras of Complemented SubsetsIosif Petrakis, Daniel Wessel. 246-258 [doi]
- On the Weihrauch Degree of the Additive Ramsey Theorem over the RationalsPierre Pradic, Giovanni Solda. 259-271 [doi]
- Reverse Mathematics of the Uncountability of ℝSam Sanders. 272-286 [doi]
- Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set TheoryVictor L. Selivanov. 287-298 [doi]
- Computational Complexity of Classical Solutions of Partial Differential EquationsSvetlana Selivanova. 299-312 [doi]
- Barendregt's Problem #26 and Combinatory Strong ReductionWilliam R. Stirton. 313-326 [doi]