Abstract is missing.
- First-Order Universality for Real ProgramsThomas Anberrée. 1-10 [doi]
- Skolem + Tetration Is Well-OrderedMathias Barra, Philipp Gerhardy. 11-20 [doi]
- Structures of Some Strong ReducibilitiesDavid R. Bélanger. 21-30 [doi]
- Complexity of Existential Positive First-Order LogicManuel Bodirsky, Miki Hermann, Florian Richoux. 31-36 [doi]
- Stochastic Programs and Hybrid Automata for (Biological) ModelingLuca Bortolussi, Alberto Policriti. 37-48 [doi]
- Numberings and RandomnessPaul Brodhead, Bjørn Kjos-Hanssen. 49-58 [doi]
- The Strength of the Grätzer-Schmidt TheoremPaul Brodhead, Bjørn Kjos-Hanssen. 59-67 [doi]
- Hyperloops Do Not Threaten the Notion of an Effective ProcedureTim Button. 68-78 [doi]
- Minimum Entropy Combinatorial Optimization ProblemsJean Cardinal, Samuel Fiorini, Gwenaël Joret. 79-88 [doi]
- Program Self-reference in Constructive Scott SubdomainsJohn Case, Samuel E. Moelius. 89-98 [doi]
- S:::0:::::1:: and P:::0:::::1:: Equivalence StructuresDouglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel. 99-108 [doi]
- Immunity for Closed SetsDouglas Cenzer, Rebecca Weber, Guohua Wu. 109-117 [doi]
- Lower Bounds for Kernelizations and Other Preprocessing ProceduresYijia Chen, Jörg Flum, Moritz Müller. 118-128 [doi]
- Infinite-Time Turing Machines and Borel ReducibilitySamuel Coskey. 129-133 [doi]
- Cutting Planes and the Parameter CutwidthStefan S. Dantchev, Barnaby Martin. 134-143 [doi]
- Members of Random Closed SetsDavid Diamondstone, Bjørn Kjos-Hanssen. 144-153 [doi]
- Lowness for Demuth RandomnessRod Downey, Keng Meng Ng. 154-166 [doi]
- Graph States and the Necessity of Euler DecompositionRoss Duncan, Simon Perdrix. 167-177 [doi]
- On Stateless Multicounter MachinesÖmer Egecioglu, Oscar H. Ibarra. 178-187 [doi]
- Computability of Continuous Solutions of Higher-Type EquationsMartÃn Hötzel Escardó. 188-197 [doi]
- Equivalence Relations on Classes of Computable StructuresEkaterina B. Fokina, Sy-David Friedman. 198-207 [doi]
- Fractals Generated by Algorithmically Random Brownian MotionWillem L. Fouché. 208-217 [doi]
- Computable Exchangeable Sequences Have Computable de Finetti MeasuresCameron E. Freer, Daniel M. Roy. 218-231 [doi]
- Spectra of Algebraic Fields and SubfieldsAndrey Frolov, Iskander Sh. Kalimullin, Russell Miller. 232-241 [doi]
- Definability in the Local Theory of the ::::omega::::-Enumeration DegreesHristo Ganchev. 242-249 [doi]
- Computability of Analytic Functions with Analytic MachinesTobias Gärtner, Günter Hotz. 250-259 [doi]
- An Application of Martin-Löf Randomness to Effective Probability TheoryMathieu Hoyrup, Cristobal Rojas. 260-269 [doi]
- Index Sets and Universal NumberingsSanjay Jain, Frank Stephan, Jason Teutsch. 270-279 [doi]
- Ordinal ComputabilityPeter Koepke. 280-289 [doi]
- A Gandy Theorem for Abstract Structures and Applications to First-Order DefinabilityOleg V. Kudinov, Victor L. Selivanov. 290-299 [doi]
- Constructing New Aperiodic Self-simulating Tile SetsGrégory Lafitte, Michael Weiss. 300-309 [doi]
- Relationship between Kanamori-McAloon Principle and Paris-Harrington TheoremGyesik Lee. 310-323 [doi]
- The First Order Theories of the Medvedev and Muchnik LatticesAndrew Lewis, André Nies, Andrea Sorbi. 324-331 [doi]
- Infima of ::::d::::.::::r::::.::::e::::. DegreesJiang Liu, Shengling Wang, Guohua Wu. 332-341 [doi]
- A Divergence Formula for Randomness and DimensionJack H. Lutz. 342-351 [doi]
- On Ladner s Result for a Class of Real Machines with Restricted Use of ConstantsKlaus Meer. 352-361 [doi]
- 0:::":::-Categorical Completely Decomposable Torsion-Free Abelian GroupsAlexander G. Melnikov. 362-371 [doi]
- Notes on the Jump of a StructureAntonio Montalbán. 372-378 [doi]
- A General Representation Theorem for Probability Functions Satisfying Spectrum ExchangeabilityJeff B. Paris, Alena Vencovská. 379-388 [doi]
- Stability under Strategy SwitchingSoumya Paul, Ramaswamy Ramanujam, Sunil Easaw Simon. 389-398 [doi]
- Computational Heuristics for Simplifying a Biological ModelIon Petre, Andrzej Mizera, Ralph-Johan Back. 399-408 [doi]
- Functions Definable by Arithmetic CircuitsIan Pratt-Hartmann, Ivo Düntsch. 409-418 [doi]
- Survey on Oblivious Routing StrategiesHarald Räcke. 419-429 [doi]
- An Approach to the Engineering of Cellular Models Based on P SystemsFrancisco José Romero-Campero, Natalio Krasnogor. 430-436 [doi]
- Decidability of Sub-theories of Polynomials over a Finite FieldAlla Sirokofskich. 437-446 [doi]
- Chaitin Omega Numbers and Halting ProblemsKohtaro Tadaki. 447-456 [doi]
- Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in MalariaPhilip M. R. Tedder, James R. Bradford, Chris J. Needham, Glenn A. McConkey, Andrew J. Bulpitt, David R. Westhead. 457-466 [doi]
- Dialectica Interpretation with Fine Computational ControlTrifon Trifonov. 467-477 [doi]
- Algorithmic Minimal Sufficient Statistic RevisitedNikolay K. Vereshchagin. 478-487 [doi]
- A Computation of the Maximal Order Type of the Term Ordering on Finite MultisetsAndreas Weiermann. 488-498 [doi]
- On Generating Independent Random StringsMarius Zimand. 499-508 [doi]